.png){kind=icon}
返回
Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2018.11.048.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Several robustness concepts for multi-objective uncertain optimization have been developed during the last years, but not many solution methods. In this paper we introduce two methods to find min-max robust efficient solutions based on scalarizations: the min-ordering and the max-ordering method. We show that all point-based min-max robust weakly efficient solutions can be found with the max-ordering method and that the min-ordering method finds set-based min-max robust weakly efficient solutions, some of which cannot be found with formerly developed scalarization based methods. We then show how the scalarized problems may be approached for multi-objective uncertain combinatorial optimization problems with special uncertainty sets. We develop compact mixed-integer linear programming formulations for multi-objective extensions of bounded uncertainty (also known as budgeted or Gamma-uncertainty). For interval uncertainty, we show that the resulting problems reduce to well-known single-objective problems. (C) 2018 The Authors. Published by Elsevier B.V.
Keyword:
Multiple objective programming
Robust optimization
Multi-objective robust optimization
Combinatorial optimization
Scalarization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
PREAI
分享收藏分享收藏分享收藏Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
PREAI
分享收藏
查看更多内容