.png){kind=icon}
.png){kind=icon}
Return
A new method for optimizing a linear function over the efficient set of a multiobjective integer program
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2016.02.037.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a new algorithm for optimizing a linear function over the set of efficient solutions of a multiobjective integer program (MOIP). The algorithm's success relies on the efficiency of a new algorithm for enumerating the nondominated points of a MOIP, which is the result of employing a novel criterion space decomposition scheme which (1) limits the number of subspaces that are created, and (2) limits the number of sets of disjunctive constraints required to define the single-objective IP that searches a subspace for a nondominated point. An extensive computational study shows that the efficacy of the algorithm. Finally, we show that the algorithm can be easily modified to efficiently compute the nadir point of a multiobjective integer program. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Multiobjective integer programming
Nondominated points
Extension of the L-shape search method
Optimizing over the efficient set
Nadir point
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W