In a transportation problem generally only the single criterion of minimizing the total cost is considered. But in certain practical situations two or more objectives are relevant. In the case of continuous variables this problem of finding all efficient points was solved by ANEJA/NAIR . Applying this method to the case of integer variables not all efficient points are found. In this paper we develope a method to find all the efficient points in the criteria space by using a quadratic objective function. Although the method is developed with respect to a bicriteria transportation problem, it is applicable to any bicriteria linear program. In this paper I consider an integer transportation problem with two objective functions and the following representation.
Unable to display preview. Download preview PDF.
- Aneja, Y.P. Nair, K.P.K. Bicriteria Transportation Problem; Management Science, Vo1.25, No.1, 1979Google Scholar
- Steuer, R.E. Multiple Criteria Optimization: Theory, computation and Application; Wiley & Sons, 1986Google Scholar
- Burkard, R.E.; Quadratic Assignement Problems, Eur. J. of OR, 15, 1984, 283–289Google Scholar