Sequential Pareto Subdifferential Sum Rule for Convex Set-Valued Mappings and Applications.

The aim of this paper is to provide a general description of the Pareto subdifferential (weak and proper) of the sum of two cone-convex set-valued mappings in terms of sequences without any constraint qualifications. As an application, we derive sequential Lagrange multipliers optimality conditions for general set-valued optimization problem in terms of sequential Lagrange multipliers at nearby points for the Pareto efficient solutions, where no constraint qualification is assumed. [ABSTRACT FROM AUTHOR]