Complex minimax programming under generalized convexity

被引:9
作者
Mishra, SK
Wang, SY
Lai, KK
机构
[1] City Univ Hong Kong, Dept Management Sci, Hong Kong, Hong Kong, Peoples R China
[2] GB Pant Univ Agr & Technol, Dept Math Stat & Comp Sci, Pantnagar 263145, Uttar Pradesh, India
[3] Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst, Beijing 100080, Peoples R China
关键词
minimax programming; generalized invex function; duality theorem;
D O I
10.1016/j.cam.2003.09.045
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We establish the Kuhn-Tucker-type sufficient optimality conditions for complex minimax programming under generalized invex functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong and strict converse duality theorems. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:59 / 71
页数:13
相关论文
共 26 条