.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
multiobjective optimization
integer programming
scalarization
Lagrangian duality
elastic constraints
crew scheduling
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
暂无机构信息
引用论文
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
.png){kind=icon}
PREAI
分享收藏
分享收藏Economics of Reducing Emissions From Deforestation and Forest Degradation: Incentives to Change Forest Use Behavior减少毁林和森林退化排放的经济分析：改变森林利用行为的激励措施
PREAI
分享收藏
查看更多内容