Abstract

In this paper we relate the Lipschitz modulus of the optimal set mapping of a canonically perturbed convex optimization problem in Rn with the Lipschitz moduli of suitable subproblems with exactly n constraints. This approach allows us to simplify other expressions for the modulus given in [8] in terms of dc functions involving the problem's data.