Generalized α-univexity and duality for nondifferentiable minimax fractional programming

The aim of the present paper is to study a nondifferentiable minimax fractional programming problem under the assumptions of α-univex and related functions. In this paper we introduce the concepts of α-univex, pseudo α-univex, strict pseudo α-univex and quasi α-univex functions respectively by unifying the notions of α-invex and univex functions. We derive Karush-Kuhn-Tucker-type sufficient optimality conditions and establish weak, strong and converse duality theorems for the problem and its three different dual problems. The results in this paper extend several known results in the literature.