.png){kind=icon}
Return
A discussion of scalarization techniques for multiple objective integer programming
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-006-0074-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we consider solution methods for multiobjective integer programming (MOIP) problems based on scalarization. We define the MOIP, discuss some common scalarizations, and provide a general formulation that encompasses most scalarizations that have been applied in the MOIP context as special cases. We show that these methods suffer some drawbacks by either only being able to find supported efficient solutions or introducing constraints that can make the computational effort to solve the scalarization prohibitive. We show that Lagrangian duality applied to the general scalarization does not remedy the situation. We also introduce a new scalarization technique, the method of elastic constraints, which is shown to be able to find all efficient solutions and overcome the computational burden of the scalarizations that use constraints on objective values. Finally, we present some results from an application in airline crew scheduling as evidence.
Keywords:
multiobjective optimization
integer programming
scalarization
Lagrangian duality
elastic constraints
crew scheduling
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
No organization information available
Cited Papers
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
.png){kind=icon}
PREAI
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more