Abstract
Mathematical programs with equilibrium constraints are optimization problems which violate most of the standard constraint qualifications. Hence the usual Karush–Kuhn–Tucker conditions cannot be viewed as first order optimality conditions unless relatively strong assumptions are satisfied. This observation has lead to a number of weaker first order conditions, with M-stationarity being the strongest among these weaker conditions. Here we show that M-stationarity is a first order optimality condition under a very weak Abadie-type constraint qualification. Our approach is inspired by the methodology employed by Jane Ye, who proved the same result using results from optimization problems with variational inequality constraints. In the course of our investigation, several concepts are translated to an MPEC setting, yielding in particular a very strong exact penalization result.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
