Set-valued minimax fractional programming problems under ρ-cone arcwise connectedness

Abstract

Abstract In this paper, we consider a set-valued minimax fractional programming problem (MFP), where the objective as well as constraint maps are set-valued. We introduce the notion of ρ-cone arcwise connectedness of set-valued maps as a generalization of cone arcwise connected set-valued maps. We establish the sufficient Karush-Kuhn-Tucker (KKT) conditions for the existence of minimizers of the problem (MFP) under ρ-cone arcwise connectedness assumption. Further, we study the Mond-Weir (MWD), Wolfe (WD), and mixed (MD) types of duality models and prove the corresponding weak, strong, and converse duality theorems between the primal (MFP) and the corresponding dual problems under ρ-cone arcwise connectedness assumption.