Abstract
We consider a special class of optimization problems that we call a Mathematical Programme with Vanishing Constraints. It has a number of important applications in structural and topology optimization, but typically does not satisfy standard constraint qualifications like the linear independence and the Mangasarian–Fromovitz constraint qualification. We therefore investigate the Abadie and Guignard constraint qualifications in more detail. In particular, it follows from our results that also the Abadie constraint qualification is typically not satisfied, whereas the Guignard constraint qualification holds under fairly mild assumptions for our particular class of optimization problems.
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.