Abstract
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 [1]. 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aneja, Y.P. Nair, K.P.K. Bicriteria Transportation Problem; Management Science, Vo1.25, No.1, 1979
Steuer, R.E. Multiple Criteria Optimization: Theory, computation and Application; Wiley & Sons, 1986
Burkard, R.E.; Quadratic Assignement Problems, Eur. J. of OR, 15, 1984, 283–289
Burkard, R.E.; Methoden der Ganzzahligen Optimierung; Springer-Verlag, Wien New York, 1972
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neumayer, P. (1993). Bicriteria Transportation Problem. In: Karmann, A., Mosler, K., Schader, M., Uebe, G. (eds) Operations Research ’92. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-12629-5_38
Download citation
DOI: https://doi.org/10.1007/978-3-662-12629-5_38
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0679-3
Online ISBN: 978-3-662-12629-5
eBook Packages: Springer Book Archive