On an Exact Penalty Result and New Constraint Qualifications for Mathematical Programs with Vanishing Constraints

  • Triloki Nath Dr. Harisingh Gour Vishwavidyalaya, Sagar
  • Abeka Khare Department of Mathematics and Statistics, School of Mathematical and Physical Sciences, Dr. Harisingh Gour Vishwavidyalaya, Sagar, Madhya Pradesh-470003, India

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
2019-07-08
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: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/637>. Date accessed: 22 nov. 2024.
Citation Formats
Issue
Vol 29 No 3 (2019)
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.