Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity

This paper continues the local analysis of nonlinear programming problems begun in Parts I and II. In this part we exploit the tools developed in the earlier parts to obtain detailed information about local optimizers in the nondegenerate case. We show, for example, that these optimizers obey a weak type of differentiability and we compute their derivatives in this weak sense.