“…Many authors investigated the optimality conditions and duality results for minimax fractional programming problems using generalized convexity assumptions, see for example [1,3,4,5,13,16,17,18,19,20,21,32,33,34,38,39,44,45] and the references cited therein. Lai et al [30] established the necessary and sufficient optimality conditions and Lai and Lee [29] obtained duality results for a class of nondifferentiable minimax programming problems with generalized convex functions.…”