OPTIMALITY AND DUALITY FOR NONSMOOTH MINIMAX FRACTIONAL PROGRAMMING PROBLEM WITH EXPONENTIAL (p, r)-INVEXITY

被引:0
|
作者
Ho, Shun-Chin [3 ]
Lai, Hang-Chin [1 ,2 ]
机构
[1] Chung Yuan Christian Univ, Dept Appl Math, Chungli, Taiwan
[2] Natl Tsing Hua Univ, Dept Math, Hsinchu, Taiwan
[3] ChungJen Coll Nursing Hlth Sci & Management, Chiayi, Taiwan
关键词
Minimax fractional programming; Lipschitz function; subdifferential; exponential (p; r)-invexity; optimality conditions; duality; V-R-INVEXITY; GENERALIZED CONVEXITY;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we consider a minimax fractional programming problem involving exponential (p, r)-invex functions with respect to eta. A new concept of invexity for a locally Lipschitz function is introduced, namely exponential (p, r)-invexity. We establish necessary and sufficient optimality conditions, employ the optimality conditions to establish the parametric dual model, and prove the related weak, strong and strict converse duality theorems under exponential (p, r)-invexity.
引用
收藏
页码:433 / 447
页数:15
相关论文
共 50 条