We consider optimization problems with inequality and abstract set constraints, and we derive sensitivity properties of Lagrange multipliers under very weak conditions. In particular, we do not assume uniqueness of a Lagrange multiplier or continuity of the perturbation function. We show that the Lagrange multiplier of minimum norm defines the optimal rate of improvement of the cost per unit constraint violation.
Citation
MIT, Lab. for Information and Decision Systems Report 2632, October 2004
Article
View Lagrange Multipliers with Optimal Sensitivity Properties