Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
