.png){kind=icon}
返回
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2018.03.018.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with uncertain multi-objective convex programming problems, where the data of the objective function or the constraints or both are allowed to be uncertain within specified uncertainty sets. We present sufficient conditions for the existence of highly robust weakly efficient solutions, that is, robust feasible solutions which are weakly efficient for any possible instance of the objective function within a specified uncertainty set. This is done by way of estimating the radius of highly robust weak efficiency under linearly distributed uncertainty of the objective functions. In the particular case of robust quadratic multi-objective programs, we show that these sufficient conditions can be expressed in terms of the original data of the problem, extending and improving the corresponding results in the literature for robust multi-objective linear programs under ball uncertainty. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Robustness and sensitivity analysis
Multi-objective optimization
Convex optimization
Robust optimization
Robust efficient solutions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Multiple objective linear programming models with interval coefficients - an illustrated overview具有区间系数的多目标线性规划模型-图解概述
PREAI
分享收藏
查看更多内容