Optimality conditions for set-valued minimax fractional programming problems
- 8 Downloads
In this paper, we establish the sufficient Karush–Kuhn–Tucker (KKT) conditions for the existence of minimizers of a set-valued minimax fractional programming problem. The duals of Mond–Weir, Wolfe, and mixed types of the said problem are also formulated and the duality results are proved.
KeywordsConvex cone Set-valued map Contingent epiderivative Duality
Mathematics Subject Classification26B25 49N15
- 1.Ahmad, I.: Optimality conditions and duality in fractional minimax programming involving generalized \(\rho \)-invexity. Int. J. Manag. Syst. 19, 165–180 (2003)Google Scholar
- 3.Aubin, J.P.: Contingent derivatives of set-valued maps and existence of solutions to nonlinear inclusions and differential inclusions. In: Nachbin, L. (ed.) Mathematical Analysis and Applications, Part A, pp. 160–229. Academic Press, New York (1981)Google Scholar