Abstract
Two types of second-order dual models for a nondifferentiable minimax fractional programming problem are formulated and proved weak, strong, strict converse duality theorems using η-bonvexity assumptions. Special cases are also discussed to show that this work extends some known results of the literature.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
