Higher-order duality in nondifferentiable minimax fractional programming involving generalized convexity
Izhar Ahmad · Journal of Inequalities and Applications · 2012
A higher-order dual for a non-differentiable minimax fractional programming problem is formulated. Using the generalized higher-order η -convexity assumptions on the functions involved, weak, strong and strict converse duality theorems are established in order to relate the primal and dual problems. Results obtained in this paper naturally unify and extend some previously known results on non-differentiable minimax fractional programming in the literature. MSC: 26A51, 90C32, 49N15.