Duality of Fractional Minimax Programming with Generalized Convex Functions

Abstract

Sufficient Kuhn-Tucker conditions for a class of generalized minimax fractional programming and three duility theorems are established under a general type of n-invexity assumption on the objective functions and constraint functions.