返回
Robust solutions to multi-objective linear programs with uncertain data
DOI:10.1016/j.ejor.2014.10.027.png)
摘要
En 中文
In this paper we examine multi-objective linear programming problems in the face of data uncertainty both in the objective function and the constraints. First, we derive a formula for the radius of robust feasibility guaranteeing constraint feasibility for all possible scenarios within a specified uncertainty set under affine data parametrization. We then present numerically tractable optimality conditions for minmax robust weakly efficient solutions, i.e., the weakly efficient solutions of the robust counterpart. We also consider highly robust weakly efficient solutions, i.e., robust feasible solutions which are weakly efficient for any possible instance of the objective matrix within a specified uncertainty set, providing lower bounds for the radius of highly robust efficiency guaranteeing the existence of this type of solutions under affine and rank-1 objective data uncertainty. Finally, we provide numerically tractable optimality conditions for highly robust weakly efficient solutions. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Robust optimization
Multi-objective linear programming
Data uncertainty
Robust feasibility
Robust weakly efficient solutions
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Understanding the Effect of Side Reactions on the Recyclability of Furan–Maleimide Resins Based on Thermoreversible Diels–Alder Network
Polymers
IF0
Correlation between the Resistance Ratios of Platinum Resistance Thermometers at the Melting Point of Gallium and the Triple Point of Mercury
Metrologia
IF0

