On an Exact Penality Result and New Constraint Qualifications for Mathematical Programs With Vanishing Constraints

Triloki Nath, Abeka Khare

In this paper, we considered the mathematical programs with vanishing constraints or MPVC. We proved 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.