Multi-objective integer programming: A general approach for generating all non-dominated solutions
In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical [epsilon]-constraint method. Objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical [epsilon]-constraint method on the bi-objective integer programming problem for the sake of completeness and comment on its efficiency. Then present our method on tri-objective integer programming problem and then extend it to the general MOIP problem with k objectives. A numerical example considering tri-objective assignment problem is also provided.
Year of publication: |
2009
|
---|---|
Authors: | Özlen, Melih ; Azizoglu, Meral |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 199.2009, 1, p. 25-35
|
Publisher: |
Elsevier |
Subject: | Multiple objective programming Integer programming |
Saved in:
Saved in favorites
Similar items by person
-
Multi-objective integer programming: A general approach for generating all non-dominated solutions
Özlen, Melih, (2009)
-
Generating all efficient solutions of a rescheduling problem on unrelated parallel machines
Özlen, Melih, (2009)
-
Multi-objective integer programming : a general approach for generating all non-dominated solutions
Özlen, Melih, (2009)
- More ...