.png){kind=icon}
返回
Robustness in nonsmooth nonlinear multi-objective programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2015.06.031.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently Georgiev, Luc, and Pardalos (2013), [Robust aspects of solutions in deterministic multiple objective linear programming, European Journal of Operational Research, 229(1), 29-36] introduced the notion of robust efficient solutions for linear multi-objective optimization problems. In this paper, we extend this notion to nonlinear case. It is shown that, under the compactness of the feasible set or convexity, each robust efficient solution is a proper efficient solution. Some necessary and sufficient conditions for robustness, with respect to the tangent cone and the non-ascent directions, are proved. An optimization problem for calculating a robustness radius followed by a comparison between the newly-defined robustness notion and two existing ones is presented. Moreover, some alterations of objective functions preserving weak/proper/robust efficiency are studied. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
Keyword:
Multiple objective programming
Robust solution
Nonsmooth optimization
Clarke generalized gradient
Proper efficiency
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
分享收藏
A newLeptographiumspecies associated with the northern spruce engraver,Ips perturbatus, in western Canada.png)
Mycologia
MycologiaIF0
PREAI
分享收藏
查看更多内容