.png){kind=icon}
返回
Robust optimal solutions in interval linear programming with forall-exists quantifiers
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2016.04.032.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce a novel kind of robustness in linear programming. A solution x* is called robust optimal if for all realizations of the objective function coefficients and the constraint matrix entries from given interval domains there are appropriate choices of the right-hand side entries from their interval domains such that x* remains optimal. We propose a method to check for robustness of a given point, and also recommend how a suitable candidate can be found. We discuss topological properties of the robust optimal solution set, too. We illustrate applicability of our concept in transportation and nutrition problems. Since not every problem has a robust optimal solution, we introduce also a concept of an approximate robust solution and develop an efficient method; as a side effect, we obtain a simple measure of robustness. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Linear programming
Robust optimization
Interval analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容