首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Necessary and Sufficient Conditions for Minimax Fractional Programming
Authors:H C Lai  J C Liu  K Tanaka
Institution: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 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号