Abstract
We consider a nonsmooth and nonconvex mathematical program with equilibrium constraints (MPEC) where its functions are not necessarily locally Lipschitz/continuous. In exploiting the idea of directional convexificators introduced by Dempe and Pelicka [Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming. J Global Optim. 2015;61:769–788], we define two forms of nonsmooth versions of the classical Abadie constraint qualifications, and introduce nonsmooth stationarity conditions, which are based on directional convexificators. Then, we employ these conditions to derive first-order optimality conditions subject to generalized Abadie constraint qualifications. Finally, we establish sufficient optimality conditions for MPEC under a new assumption of generalized convexity.
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.
