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

نویسندگان

  • Lukás Adam
  • René Henrion
  • Jirí V. Outrata
چکیده

Depending on whether a mathematical program with equilibrium constraints 6 (MPEC) is considered in its original or its enhanced (via KKT conditions) form, the assumed 7 constraint qualifications (CQs) as well as the derived necessary optimality conditions may 8 differ significantly. In this paper, we study this issue when imposing one of the weakest pos9 sible CQs, namely the calmness of the perturbation mapping associated with the respective 10 generalized equations in both forms of the MPEC. It is well known that the calmness prop11 erty allows one to derive so-called M-stationarity conditions. The strength of assumptions 12 and conclusions in the two forms of the MPEC is strongly related with the CQs on the ’lower 13 level’ imposed on the set whose normal cone appears in the generalized equation. For in14 stance, under just the Mangasarian-Fromovitz CQ (a minimum assumption required for this 15 set), the calmness properties of the original and the enhanced perturbation mapping are dras16 tically different. They become identical in the case of a polyhedral set or when adding the 17 Full Rank CQ. On the other hand, the resulting optimality conditions are affected too. If the 18 considered set even satisfies the Linear Independence CQ, both the calmness assumption 19 and the derived optimality conditions are fully equivalent for the original and the enhanced 20 form of the MPEC. A compilation of practically relevant consequences of our analysis in 21 the derivation of necessary optimality conditions is provided in the main Theorem 7. The 22 obtained results are finally applied to MPECs with structured equilibria. 23

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Necessary and Sufficient Optimality Conditions for Mathematical Programs with Equilibrium Constraints∗

In this paper we consider a mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with complementarity constraints. Various stationary conditions for MPECs exist in literature due to different reformulations. We give a simple proof to the M-stationary condition and show that it is sufficient for global or local optimality under some MPEC generalized conve...

متن کامل

A Dc (difference of Convex Functions) Approach of the Mpecs

This article deals with a study of the MPEC problem based on a reformulation to a DC problem (Difference of Convex functions). This reformulation is obtained by a partial penalization of the constraints. In this article we prove that a classical optimality condition for a DC program, if a constraint qualification is satisfied for MPEC, it is a necessary and sufficient condition for a feasible p...

متن کامل

Enhanced Karush-Kuhn-Tucker Conditions for Mathematical Programs with Equilibrium Constraints

In this paper we study necessary optimality conditions for nonsmooth mathematical programs with equilibrium constraints (MPECs). We first show that MPEC-LICQ is not a constraint qualification for the strong (S-) stationary condition when the objective function is nonsmooth. Enhanced Fritz John conditions provide stronger necessary optimality conditions under weaker constraint qualifications. In...

متن کامل

Optimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints

We consider optimization problems with a disjunctive structure of the constraints. Prominent examples of such problems are mathematical programs with equilibrium constraints or vanishing constraints. Based on the concepts of directional subregularity and their characterization by means of objects from generalized differentiation, we obtain the new stationarity concept of extended M-stationarity...

متن کامل

A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties

Mathematical programs with equilibrium (or complementarity) constraints, MPECs for short, form a difficult class of optimization problems. The feasible set has a very special structure and violates most of the standard constraint qualifications. Therefore, one typically applies specialized algorithms in order to solve MPECs. One very prominent class of specialized algorithms are the regularizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 168  شماره 

صفحات  -

تاریخ انتشار 2018