Calmness in Optimization Problems with Equality Constraints

It is well known that a mathematical program that incorporates inequality constraints is calm almost everywhere. In this paper, counterexamples are provided to show that a problem with equality constraints need not be calm almost everywhere. In addition, we provide conditions that insure that a problem with equality constraints is calm at local optimizers almost everywhere