5 results
Search Results
Now showing 1 - 5 of 5
- ItemAnalysis of M-stationary points to an EPEC modeling oligopolistic competition in an electricity spot market(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2009) Henrion, René; Outrata, Jií̌; Surowiec, ThomasWe consider an equilibrium problem with equilibrium constraints (EPEC) as it arises from modeling competition in an electricity spot market (under ISO regulation). For a characterization of equilibrium solutions, so-called M-stationarity conditions are derived. This requires a structural analysis of the problem first (constraint qualifications, strong regularity). Second, the calmness property of a certain multifunction has to be verified in order to justify M-stationarity. Third, for stating the stationarity conditions, the co-derivative of a normal cone mapping has to be calculated. Finally, the obtained necessary conditions are made fully explicit in terms of the problem data for one typical constellation. A simple two-settlements example serves as an illustration.
- ItemCritical objective size and calmness modulus in linear programming(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2015) Cánovas, Maria J.; Henrion, René; Parra, Juan; Toledo, F. JavierThis paper introduces the concept of critical objective size associated with a linear program in order to provide operative point-based formulas (only involving the nominal data, and not data in a neighborhood) for computing or estimating the calmness modulus of the optimal set (argmin) mapping under uniqueness of nominal optimal solution and perturbations of all coefficients. Our starting point is an upper bound on this modulus given in [4]. In this paper we prove that this upper bound is attained if and only if the norm of the objective function coefficient vector is less than or equal to the critical objective size. This concept also allows us to obtain operative lower bounds on the calmness modulus. We analyze in detail an illustrative example in order to xplore some strategies that can improve the referred upper and lower bounds.
- ItemOn the co-derivative of normal cone mappings to inequality systems(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2008) Henrion, René; Outrata, Jiří; Surowiec, ThomasThe paper deals with co-derivative formulae for normal cone mappings to smooth inequality systems. Both, the regular (Linear Independence Constraint Qualification satisfied) and nonregular (Mangasarian-Fromovitz Constraint Qualification satisfied) case are considered. A major part of the results relies on general transformation formulae previously obtained by Mordukhovich and Outrata. This allows to derive exact formulae for general smooth, regular and polyhedral, possibly nonregular systems. In the nonregular, nonpolyhedral case a generalized transformation formula by Mordukhovich and Outrata applies, however a major difficulty consists in checking a calmness condition of a certain multivalued mapping. The paper provides a translation of this condition in terms of much easier to verify constraint qualifications. A series of examples illustrates the use and comparison of the presented formulae.
- ItemOn M-stationarity conditions in MPECs and the associated qualification conditions(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2016) Adam, Lukáš; Henrion, René; Outrata, Jir̆íDepending on whether a mathematical program with equilibrium constraints (MPEC) is considered in its original or its enhanced (via KKT conditions) form, the assumed constraint qualifications (CQs) 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 CQs, 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 socalled M-stationarity conditions. The strength of assumptions and conclusions in the two forms of the MPEC is strongly related with the CQs on the lower level imposed on the set whose normal cone appears in the generalized equation. For instance, under just the Mangasarian-Fromovitz CQ (a minimum assumption required for this set), the calmness properties of the original and the enhanced perturbation mapping are drastically different. They become identical in the case of a polyhedral set or when adding the Full Rank CQ. On the other hand, the resulting optimality conditions are affected too. If the considered set even satisfies the Linear Independence CQ, both the calmness assumption and the derived optimality conditions are fully equivalent for the original and the enhanced form of the MPEC. A compilation of practically relevant consequences of our analysis in the derivation of necessary optimality conditions is provided in the main Theorem 4.3. The obtained results are finally applied to MPECs with structured equilibria.
- ItemOn calmness conditions in convex bilevel programming(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2010) Henrion, René; Surowiec, ThomasIn this article we compare two different calmness conditions which are widely used in the literature on bilevel programming and on mathematical programs with equilibrium constraints. In order to do so, we consider convex bilevel programming as a kind of intersection between both research areas. The so-called partial calmness concept is based on the function value approach for describing the lower level solution set. Alternatively, calmness in the sense of multifunctions may be considered for perturbations of the generalized equation representing the same lower level solution set. Both concepts allow to derive first order necessary optimality conditions via tools of generalized differentiation introduced by Mordukhovich. They are very different, however, concerning their range of applicability and the form of optimality conditions obtained. The results of this paper seem to suggest that partial calmness is considerably more restrictive than calmness of the perturbed generalized equation. This fact is also illustrated by means of a dicretized obstacle control problem.