Authors: Felix Harder

It is known in the literature that local minimizers of mathematical programs with complementarity constraints (MPCCs) are so-called M-stationary points, if a weak MPCC-tailored Guignard constraint qualification (called MPCC-GCQ) holds. In this paper we present a new elementary proof for this result. Our proof is significantly simpler than existing proofs and does not rely on deeper technical theory such as calculus rules for limiting normal cones. A crucial ingredient is a proof of a (to the best of our knowledge previously open) conjecture, which was formulated in a Diploma thesis by Schinabeck.

• 49J52 - Nonsmooth analysis
• 90C30 - Nonlinear programming
• 90C33 - Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
• 90C46 - Optimality conditions and duality in mathematical programming