  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.
