In this article we establish necessary conditions for local Pareto and weak minima of multiobjective programming problems involving inequality, equality and set constraints in Banach spaces in terms of convexificators.
No takes yet. Share an insight, caveat, or question.
Do Van Luu (2012) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: