The vector exact l1 penalty method for nondifferentiable convex multiobjective programming problems

In this paper, the vector exact l1 penalty function method for nondifferentiable convex multiobjective programming problems is analyzed. The vector penalized optimization problem with the vector exact l1 penalty function is defined. Conditions are given guaranteeing the equivalence of the sets of (weak) Pareto optimal solutions of the considered nondifferentiable multiobjective programming problem and of the associated vector penealized optimization problem with the vector exact l1 penalty function. This equivalence is established for nondifferentiable vector optimization problems with convex functions.