Abstract
In this chapter, a new generalized class of higher order (F, \( \alpha \), ρ, d)-type 1 univex function is introduced with examples. KKT necessary and sufficient conditions for efficient solution for fractional programming with higher order (F, \( \alpha \), ρ, d)-type 1 univex function are established. Higher order mixed type duality for nonsmooth multiobjective fractional programming (MFP) is formulated and using the generalized higher order (F, \( \alpha \), ρ, d)-type 1 univexity assumption in the functions involved, the duality results are established. At the end, some special cases are discussed.
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
