MIXED TYPE DUALITY FOR A NONDIFFERENTIABLE MINIMAX FRACTIONAL COMPLEX PROGRAMMING

被引:0
|
作者
Lai, Hang-Chin [1 ]
Huang, Tone-Yau [2 ]
机构
[1] Natl Tsing Hua Univ, Dept Math, Hsinchu, Taiwan
[2] Feng Chia Univ, Dept Appl Math, Taichung 40724, Taiwan
来源
PACIFIC JOURNAL OF OPTIMIZATION | 2014年 / 10卷 / 02期
关键词
fractional programming; duality; generalized convexity; OPTIMALITY CONDITIONS;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a nondifferentiable minimax complex fractional programming problem (P) in this paper. We will construct a mixed type dual problem (MD) for problem (P). Therefore problem (MD) can include the Wolfe type dual problem (WD) and the Mond-Weir type dual problem (MWD) of problem (P). Finally, we prove the duality theorems of (MD). This means that there are no duality gaps between problem (P) and problem (MD).
引用
收藏
页码:305 / 319
页数:15
相关论文
共 50 条