2009
DOI: 10.1007/s11228-009-0103-6
|View full text |Cite
|
Sign up to set email alerts
|

Constraint Qualifications for Nonsmooth Mathematical Programs with Equilibrium Constraints

Abstract: We study nonsmooth mathematical programs with equilibrium constraints. First we consider a general disjunctive program which embeds a large class of problems with equilibrium constraints. Then, we establish several constraint qualifications for these optimization problems. In particular, we generalize the Abadie and Guignard-type constraint qualifications. Subsequently, we specialize these results to mathematical program with equilibrium constraints. In our investigation, we show that a local minimum results i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 28 publications
0
4
0
Order By: Relevance
“…The notion of generalized convexity introduced by Singh and Laha [41] which unifies the functions introduced by Antczak [2] and by Nobakhtian [38] has been used to explore the criteria under which a š‘Šāˆ’stationary point becomes a global (or a local) minimizer of the QMPEC. Further, some other constraint qualifications and stationary conditions [16,18,22,36,44] under different generalized convexity assumptions [26,34,35,42] can be investigated for the QMPEC. Moreover, quasidifferentiable analaysis can be used to solve mathematical programs with vanishing constraints [29,30,33,37] involving quasidifferentiable functions.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The notion of generalized convexity introduced by Singh and Laha [41] which unifies the functions introduced by Antczak [2] and by Nobakhtian [38] has been used to explore the criteria under which a š‘Šāˆ’stationary point becomes a global (or a local) minimizer of the QMPEC. Further, some other constraint qualifications and stationary conditions [16,18,22,36,44] under different generalized convexity assumptions [26,34,35,42] can be investigated for the QMPEC. Moreover, quasidifferentiable analaysis can be used to solve mathematical programs with vanishing constraints [29,30,33,37] involving quasidifferentiable functions.…”
Section: Discussionmentioning
confidence: 99%
“…A partial precise penalty for MPECs was developed by Liu et al [28]. Movahedian and Nobakhtian [36] studied nonsmooth MPECs. A number of CQs for MPECs were investigated by Guo and Lin [22].…”
Section: Introductionmentioning
confidence: 99%
“…Flegel et al [12] considered optimization problems with a disjunctive structure of the feasible set and obtained optimality conditions for disjunctive programs with application to MPEC using Guignard-type constraint qualifications. Movahedian and Nobakhtian [33] introduced nonsmooth strong stationarity, M-stationarity and generalized Abadie and Guignard-type constraint qualifications for nonsmooth MPEC. Movahedian and Nobakhtian [34] introduced a nonsmooth type M-stationary condition based on the Michel-Penot subdifferential and established the Kuhn-Tucker, Fritz-John-type, M-stationary necessary conditions for the nonsmooth MPEC.…”
Section: Introductionmentioning
confidence: 99%
“…For results on mathematical programs with complementarity constraints (MPCCs) with smooth data, the reader is referred for example to [13,33]. Nonsmooth MPCCs were recently considered in [25,26] while using generalized differentiation tools by Clarke and Michel-Penot. Not only the model in the latter papers does not encompass our problem in (4.1) which contains both set-valued and complementarity constraints, but we rather provide the most natural extensions of the stationarity conditions of (4.1) from a completely different perspective.…”
mentioning
confidence: 99%