NEW CONSTRAINT QUALIFICATION AND OPTIMALITY FOR LINEAR SEMI-INFINITE PROGRAMMING

被引:0
|
作者
Liu, Yanqun [1 ]
机构
[1] RMIT Univ, Sch Sci, 360 Swanston St, Melbourne, Vic 3000, Australia
来源
PACIFIC JOURNAL OF OPTIMIZATION | 2016年 / 12卷 / 02期
关键词
linear semi-infinite programming; constraint qualification; optimality; OPTIMIZATION;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this short paper, we present a new constraint qualification (CQ) for linear semi-infinite programming (LSIP) called directional Farkas-Minkowski CQ that characterizes the class of all LSIP problems for which a feasible solution is optimal if and only if it satisfies the classical optimality conditions. Furthermore, presented in terms of the new CQ, an new form of some recent optimality conditions without CQ for LSIP is obtained.
引用
收藏
页码:223 / 232
页数:10
相关论文
共 50 条