Abstract
We consider the mathematical program with vertical complementarity constraints. We show that the min-max-min problems and the problems with max-min constraints can be reformulated as the above problem. As a complement of the work of Scheel and Scholtes in 2000, we derive the Mordukhovich-type stationarity conditions for the considered problem. We further reformulate various popular stationarity systems as nonlinear equations with simple constraints. A modified Levenberg–Marquardt method is employed to solve these constrained equations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.