On Nonsmooth Semi-Infinite Minimax Programming Problem with (Φ, ρ)-Invexity

被引：0
|
作者：
Liu, X. L. [1 ]
Lai, G. M. [2 ]
Xu, C. Q. [3 ]
Yuan, D. H. [1 ]
机构：
[1] Hanshan Normal Univ, Dept Math, Chaozhou 521041, Guangdong, Peoples R China
[2] Hanshan Normal Univ, Dept Comp Sci, Chaozhou 521041, Guangdong, Peoples R China
[3] Beijing Univ Civil Engn & Architecture, Coll Sci, Beijing 102616, Peoples R China
来源：
ABSTRACT AND APPLIED ANALYSIS | 2014年
关键词：
DUALITY; INVEXITY;
D O I：
10.1155/2014/317304
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We are interested in a nonsmooth minimax programming Problem (SIP). Firstly, we establish the necessary optimality conditions theorems for Problem (SIP) when using the well-known Caratheodory's theorem. Under the Lipschitz (Phi, rho)-invexity assumptions, we derive the sufficiency of the necessary optimality conditions for the same problem. We also formulate dual and establish weak, strong, and strict converse duality theorems for Problem (SIP) and its dual. These results extend several known results to a wider class of problems.
引用
收藏
页数：7
相关论文
共 50 条
12345