2000 character limit reached
Lagrangian Multipliers for Presubconvexlike Optimization Problems of Set Valued Functions
Published 12 Jun 2017 in math.OC | (1706.03728v1)
Abstract: In this paper, we discuss scalar Lagrangian multipliers and vector Lagrangian multipliers for constrained set-valued optimization problems. We obtain some necessary conditions, sufficient conditions, as well as necessary and sufficient conditions for the existence of weakly efficient solutions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.