Back to Search Start Over

On M-stationarity conditions in MPECs and the associated qualification conditions.

Authors :
Adam, Lukáš
Outrata, Jiří
Henrion, René
Source :
Mathematical Programming. Mar2018, Vol. 168 Issue 1/2, p229-259. 31p.
Publication Year :
2018

Abstract

Depending on whether a mathematical program with equilibrium constraints (MPEC) is considered in its original or its enhanced (via KKT conditions) form, the assumed qualification conditions as well as the derived necessary optimality conditions may differ significantly. In this paper, we study this issue when imposing one of the weakest possible qualification conditions, namely the calmness of the perturbation mapping associated with the respective generalized equations in both forms of the MPEC. It is well known that the calmness property allows one to derive the so-called M-stationarity conditions. The restrictiveness of assumptions and the strength of conclusions in the two forms of the MPEC is also strongly related to the qualification conditions on the “lower level”. For instance, even under the linear independence constraint qualification (LICQ) for a lower level feasible set described by C1<inline-graphic></inline-graphic> functions, the calmness properties of the original and the enhanced perturbation mapping are drastically different. When passing to C1,1<inline-graphic></inline-graphic> data, this difference still remains true under the weaker Mangasarian–Fromovitz constraint qualification, whereas under LICQ both the calmness assumption and the derived optimality conditions are fully equivalent for the original and the enhanced form of the MPEC. After clarifying these relations, we provide a compilation of practically relevant consequences of our analysis in the derivation of necessary optimality conditions. The obtained results are finally applied to MPECs with structured equilibria. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
00255610
Volume :
168
Issue :
1/2
Database :
Academic Search Index
Journal :
Mathematical Programming
Publication Type :
Academic Journal
Accession number :
128186340
Full Text :
https://doi.org/10.1007/s10107-017-1146-3