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.
Published
Jul 8, 2019
How to Cite
NATH, Triloki; KHARE, Abeka.
On an Exact Penalty Result and New Constraint Qualifications for Mathematical Programs with Vanishing Constraints.
Yugoslav Journal of Operations Research, [S.l.], v. 29, n. 3, p. 309-324, july 2019.
ISSN 2334-6043.
Available at: <http://www.yujor.fon.bg.ac.rs/index.php/yujor/article/view/637>. Date accessed: 29 mar. 2024.
Issue
Section
Articles
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.