Optimally and duality for complex nondifferentiable fractional programming

被引:9
|
作者
Liu, JC
Lin, CC
Sheu, RL
机构
[1] NATL CENT UNIV,DEPT MATH,CHUNGLI 32054,TAIWAN
[2] NATL CHENG KUNG UNIV,DEPT MATH,TAINAN 70101,TAIWAN
关键词
D O I
10.1006/jmaa.1997.5448
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Both parametric and nonparametric necessary and sufficient optimality conditions are established for a class of complex nondifferentiable fractional programming problems containing generalized convex functions. Subsequently, these optimality criteria are utilized as a basis for constructing one parametric and two other parameter-free dual models With appropriate duality theorems. (C) 1997 Academic Press.
引用
收藏
页码:804 / 824
页数:21
相关论文
共 50 条