Abstract
In this paper, a second-order duality for a non-differentiable minimax fractional programming is formulated by generalizing the one developed by Husian et al. [Second order duality for minimax fractional programming, Optim. Lett. 3 (2009), pp. 277–286], for the minimax fractional programming. The weak, strong and strict converse duality theorems are proved for these programs under generalized η-bonvexity assumptions.
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.
