Optimality conditions in convex multiobjective SIP (Q2364489): Difference between revisions

The authors are concerned with characterizations of several types of solutions of optimization problems with finitely many objective functions and infinitely many constraints (MOSIPs). The authors first present 14 new and known global and local conditions on constraints and/or objectives of MOSIPs and prove connections between them. They then use these data qualifications to prove necessary and sufficient optimality conditions in terms of Karush-Kuhn-Tucker multipliers and a new gap function for weak efficient, efficient and isolated efficient solutions of convex MOSIPs. Significantly, these results include the first optimality conditions for non-continuous convex MOSIPs.