On an Exact Penalty Result and New Constraint Qualifications for Mathematical Programs with Vanishing Constraints
Abstract: In this paper, the mathematical programs with vanishing constraints or MPVC are considered. We prove that an MPVC-tailored penalty function, introduced in [5], is still exact under a very weak and new constraint qualification. Most importantly, this constraint qualification is shown to be strictly stronger than MPVC-Abadie constraint qualification.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.