Necessary and sufficient conditions for minimax fractional programming

被引:66
|
作者
Lai, HC [1 ]
Liu, JC
Tanaka, K
机构
[1] IShou Univ, Dept Math Appl, Kaohsiung 84008, Taiwan
[2] Natl Overseas Chinese Student Univ, Mat Sect, Linkou 24499, Taiwan
[3] Niigata Univ, Dept Math, Niigata, Japan
关键词
minimax fractional problem; pseudo-convex; quasi-convex; duality;
D O I
10.1006/jmaa.1998.6204
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We establish the necessary and sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems solving generalized convex functions. Subsequently, we apply the optimality conditions to formulate one parametric dual problem and we prove weak duality, strong duality, and strict converse duality theorems. (C) 1999 Academic Press.
引用
收藏
页码:311 / 328
页数:18
相关论文
共 50 条