Lipschitzian Solutions of Perturbed Nonlinear Programming Problems

This is the publisher's version, also available electronically from http://epubs.siam.org/doi/abs/10.1137/0324068.We prove that if a second order sufficient condition and a constraint regularity assumption hold, then for sufficiently small perturbations of the constraints and the objective function, the set of local minimizers reduces to a singleton. Moreover, the minimizes and the associated multipliers are Lipschitzian functions of the parameter