Optimality conditions and duality for a minimax fractional programming with generalized convexity ✩

We establish the sufficient conditions for generalized fractional programming from a viewpoint of the generalized convexity. When the sufficient conditions are utilized, the corresponding duality theorems are derived for two types of duals of the generalized fractional programming. We extend the corresponding results of several authors.  2002 Elsevier Science (USA). All rights reserved.