Goal programming approach to solve linear transportation problems with multiple objectives.

In multi-objective transportation, due to the conflicting nature of objectives, no method is available to find the best compromise optimal solution. In this paper, we present a method to obtain a compromised solution for multi-objective transportation problems under a weighted environment. In which, a modified weighted model is presented that provides us with an efficient solution according to the priorities of the decision maker. To measure the efficiency of the method, a numerical example is included and the results are compared with previously reported work for the same numerical problems to illustrate the feasibility and the applicability of the proposed method. [ABSTRACT FROM AUTHOR]