On the implicit programming approach in a class of mathematical programs with equilibrium constraints

In the paper we analyze the influence of implicit programming hypothesis and presence of state constraints on first order optimality conditions to mathematical programs with equilibrium constraints. In the absence of state constraints, we derive sharp stationarity conditions, provided the strong regularity condition holds. In the second part of the paper we suggest an exact penalization of state constraints and test the behavior of standard bundle trust region algorithm on academic examples.