Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps (Q2176278)

In recent years, vector optimization problems with set-valued maps have received increasing attention. In this work, the authors establish sequential optimality conditions for approximate weak Pareto solutions for a convex vector optimization problem with set-valued maps (without any constraint qualification) by using some cone-convexity notions and the scalarization technique. Then, a new sequential form of Lagrange multiplier condition for approximate optimality in terms of approximate subdifferentials is obtained. The obtained results differ from other sequential optimality results established in the literature, where the scalarization function the so-called oriented distance functions and coderivatives are considered.