Abstract
Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: November 2000/Final version received: June 2001
Rights and permissions
About this article
Cite this article
Andreani, R., Martı´nez, J. On the solution of mathematical programming problems with equilibrium constraints. Mathematical Methods of OR 54, 345–358 (2001). https://doi.org/10.1007/s001860100158
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001860100158