.png){kind=icon}
返回
Constraint qualifications in linear vector semi-infinite optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2012.09.006.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Linear vector semi-infinite optimization deals with the simultaneous minimization of finitely many linear scalar functions subject to infinitely many linear constraints. This paper provides characterizations of the weakly efficient, efficient, properly efficient and strongly efficient points in terms of cones involving the data and Karush-Kuhn-Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The global constraint qualifications are illustrated on a collection of selected applications. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Multiple objective programming
Linear vector semi-infinite optimization
Constraint qualifications
Cone conditions
KKT conditions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
European finance in the American mirror: financial change and the reconfiguration of competitiveness
PREAI
分享收藏分享收藏
查看更多内容