Duality for Fractional Minimax Programming^∗^∗The research is partly supported by NSC, Taiwan.$ef:

Abstract

We establish the Kuhn-Tucker sufficient optimality conditions for a class of generalized minimax fractional programming involving pseudoconvex and quasiconvex functions. Subsequently, these optimality criteria are utilized as a basis for constructing three dual models and certain duality results have been derived in the framework of generalized convex functions