Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints

Sajjad Kazemi () and Nader Kanzi ()
Additional contact information
Sajjad Kazemi: Payam Noor University
Nader Kanzi: Payam Noor University

Journal of Optimization Theory and Applications, 2018, vol. 179, issue 3, No 4, 800-819

Abstract: Abstract This paper aims at studying a broad class of mathematical programming with non-differentiable vanishing constraints. First, we are interested in some various qualification conditions for the problem. Then, these constraint qualifications are applied to obtain, under different conditions, several stationary conditions of type Karush/Kuhn–Tucker.

Keywords: Constraint qualification; Stationary conditions; Optimality conditions; Vanishing constraints; 90C46; 90C33; 49K10 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-018-1373-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:179:y:2018:i:3:d:10.1007_s10957-018-1373-7

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-018-1373-7

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().