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.