Optimality and Duality for Nondifferentiable Minimax Fractional Programming with Generalized Convexity

Abstract EN

We establish several sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems from a view point of generalized convexity.

Subsequently, these optimality criteria are utilized as a basis for constructing dual models, and certain duality results have been derived in the framework of generalized convex functions.

Our results extend and unify some known results on minimax fractional programming problems.