Necessary and Sufficient Conditions for Minimax Fractional Programming |
| |
Authors: | H. C. Lai J. C. Liu K. Tanaka |
| |
Affiliation: | a Department of Applied Mathematics, I-Shou University, Ta-Hsu, Kaohsiung, 84008, Taiwan;b Section of Mathematics, National Overseas Chinese Student University, Linkou, 24499, P.O. Box 1-1337, Taiwan;c Department of Mathematics, Niigata University, Niigata, Japan |
| |
Abstract: | 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. |
| |
Keywords: | minimax fractional problem pseudo-convex quasi-convex duality |
本文献已被 ScienceDirect 等数据库收录! |
|