A CONSTRAINT QUALIFICATION CHARACTERIZING SURROGATE DUALITY FOR QUASICONVEX PROGRAMMING

被引:0
作者
Suzuki, Satoshi [1 ]
Kuroiwa, Daishi [1 ]
机构
[1] Shimane Univ, Dept Math, 1060 Nishikawatsu, Matsue, Shimane 6908504, Japan
来源
PACIFIC JOURNAL OF OPTIMIZATION | 2016年 / 12卷 / 01期
关键词
surrogate strong duality; surrogate min-max duality; quasiconvex programming; constraint qualification; OPTIMIZATION; SYSTEMS;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we study a constraint qualification which completely characterizes surrogate duality for quasiconvex programming. We show that the closed cone constraint qualification for surrogate duality is a necessary and sufficient constraint qualification for surrogate strong duality and surrogate min-max duality via quasiconvex programming with convex constraints. Also, we compare our constraint qualification with previous ones for Lagrange duality and surrogate duality.
引用
收藏
页码:87 / 100
页数:14
相关论文
共 21 条
[1]   Zero duality gap in surrogate constraint optimization: A concise review of models [J].
Alidaee, Bahram .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 232 (02) :241-248
[2]  
[Anonymous], 2010, LECT NOTES EC MATH S
[3]   A MULTIPHASE-DUAL ALGORITHM FOR ZERO-1 INTEGER PROGRAMMING PROBLEM [J].
GLOVER, F .
OPERATIONS RESEARCH, 1965, 13 (06) :879-&
[4]   Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities [J].
Goberna, M. A. ;
Jeyakumar, V. ;
Lopez, M. A. .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2008, 68 (05) :1184-1194
[5]   SURROGATE MATHEMATICAL PROGRAMMING [J].
GREENBERG, HJ ;
PIERSKALLA, WP .
OPERATIONS RESEARCH, 1970, 18 (05) :924-+
[6]   GENERALIZED PENALTY FUNCTION SURROGATE MODEL [J].
GREENBERG, HJ .
OPERATIONS RESEARCH, 1973, 21 (01) :162-178
[7]  
Greenberg HJ., 1973, Cahiers Centre tudes Rech. Opr, V15, P437
[8]   Constraint qualifications characterizing Lagrangian duality in convex optimization [J].
Jeyakumar, V. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2008, 136 (01) :31-41
[9]   Characterizing set containments involving infinite convex constraints and reverse-convex constraints [J].
Jeyakumar, V .
SIAM JOURNAL ON OPTIMIZATION, 2003, 13 (04) :947-959
[10]  
Jeyakumar V., 2004, 048 AMR U NEW S WAL