Three algorithms for bicriteria integer linear programs
Abstract
A problem in multiobjective programming is to determine all efficient solutions. As a first approach we present a basic algorithm where only one of the objective functions is minimized and the second objective function is taken as a restriction. In the next algorithm the maximum of both objective functions is minimized. In the third algorithm this minimax function is replaced by a continuous quadratic objective function.
Key words
Bicriteria integer programming integer linear programming bi-objective optimization multiobjective optimizationZusammenfassung
Mit drei verschiedenen Algorithmen werden alle effizienten Lösungen eines bikriteriellen, ganzzahligen Programms bestimmt. Zunächst wird die zweite Zielfunktion als Restriktion benutzt, dann das Maximum der beiden Zielfunktionen minimiert, schließlich wird diese Minimax-Funktion durch eine quadratische Funktion ersetzt.
Schlüsselwörter
Bikriterielle ganzzahlige lineare Programmierung VektoroptimierungPreview
Unable to display preview. Download preview PDF.
References
- 1.Aneja YP, Nair KPK (1979) Bicriteria transportation problem. Manag Sci 25:73–78CrossRefGoogle Scholar
- 2.Burkard RE (1972) Methoden der ganzzähligen Optimierung. Springer, Berlin Heidelberg New YorkCrossRefGoogle Scholar
- 3.Chung S-J, Hamacher HW, Maffioli F, Murty KG (1993) A note on combinatorial optimization with max-linear objective functions. Discrete Appl Math 42:139–145CrossRefGoogle Scholar
- 4.Eswaran PK, Ravindran A, Moskowitz H (1989) Algorithms for nonlinear integer bicriterion problems. Opt Theory Appl 63: (2) 261–279CrossRefGoogle Scholar
- 5.Garey RM, Johnson DS (1979) Computers and intractability — a guide to the theory ofNP-completeness. W. H. Freeman, San FranciscoGoogle Scholar
- 6.Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. J Math Anal Appl 22:618–630CrossRefGoogle Scholar
- 7.Habenicht W (1990) Neuere Entwicklungen auf dem Gebiet der Vektoroptimierung. Operations Research Proceedings 1990, DGOR. Springer, Berlin Heidelberg New York, pp 204–218Google Scholar
- 8.Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley & Sons, New York ChichesterCrossRefGoogle Scholar
- 9.Neumayer P (1990) Transportprobleme mit zweifacher Zielsetzung. Diplomarbeit; Fachbereich Mathematik, Universität KaiserslauternGoogle Scholar
- 10.Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization. Prentice Hall, Englewood CliffsGoogle Scholar
- 11.Schrijver A (1986) Theory of linear and integer programming. Wiley & Sons, Chichester New YorkGoogle Scholar
- 12.Schweigert D (1990) Linear extensions and vector-valued spanning trees. Methods of Operation Research 60, Anton Hain, FrankfurtGoogle Scholar
- 13.Steuer RE (1986) Multiple criteria optimization; theory, computation and application. Wiley & Sons, New YorkGoogle Scholar
- 14.Zeleny M (1974) Linear multiobjective programming. Springer, New York Berlin HeidelbergCrossRefGoogle Scholar