Abstract
Minimax fractional programming problems are analyzed from the view- point of lower subdifferentiability, obtaining Kuhn-Tucker type optimality conditions. Multiobjective optimization problems with fractional objectives are also studied.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
