Abstract
Based on the extended Ljusternik Theorem by Jimenez-Novo, necessary conditions for weak Pareto minimum of multiobjective programming problems involving inequality, equality and set constraints in terms of convexificators are established. Under assumptions on generalized convexity, necessary conditions for weak Pareto minimum become sufficient conditions.
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
