<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0474227</ARLID> <utime>20240103214018.4</utime><mtime>20170427235959.9</mtime>   <SCOPUS>85017593151</SCOPUS> <WOS>000426071000010</WOS>  <DOI>10.1007/s10107-017-1146-3</DOI>           <title language="eng" primary="1">On M-stationarity conditions in MPECs and the associated qualification conditions</title>  <specification> <page_count>31 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0257227</ARLID><ISSN>0025-5610</ISSN><title>Mathematical Programming</title><part_num/><part_title/><volume_id>168</volume_id><page_num>229-259</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>    <keyword>Mathematical programs with equilibrium constraints</keyword>   <keyword>Optimality conditions</keyword>   <keyword>Constraint qualification</keyword>   <keyword>Calmness</keyword>   <keyword>Perturbation mapping</keyword>    <author primary="1"> <ARLID>cav_un_auth*0309054</ARLID> <name1>Adam</name1> <name2>Lukáš</name2> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept language="eng">Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department language="eng">MTR</department> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept> <country>CZ</country> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0015558</ARLID> <name1>Henrion</name1> <name2>R.</name2> <country>DE</country> </author> <author primary="0"> <ARLID>cav_un_auth*0101173</ARLID> <name1>Outrata</name1> <name2>Jiří</name2> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2017/MTR/adam-0474227.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0321507</ARLID> <project_id>GA15-00735S</project_id> <agency>GA ČR</agency> </project>  <abstract language="eng" primary="1">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 theMPECis 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 C^1 functions, the calmness properties of the original and the enhanced perturbation mapping are drastically different. When passing to C^{1,1} 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>     <result_subspec>WOS</result_subspec> <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10101</FORD2>    <reportyear>2019</reportyear>      <num_of_auth>3</num_of_auth>  <unknown tag="mrcbC52"> 4 A hod 4ah 20231122142418.0 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0271365</permalink>  <cooperation> <ARLID>cav_un_auth*0305285</ARLID> <name>Weierstraß-Institut für Angewandte Analysis und Stochastik</name> <country>DE</country> </cooperation> <unknown tag="mrcbC64"> 1 Department of Decision Making Theory UTIA-B 10102 MATHEMATICS, APPLIED </unknown>  <confidential>S</confidential>  <unknown tag="mrcbC86"> 2 Article Computer Science Software Engineering|Operations Research Management Science|Mathematics Applied </unknown>         <unknown tag="mrcbT16-e">COMPUTERSCIENCE.SOFTWAREENGINEERING|OPERATIONSRESEARCH&amp;MANAGEMENTSCIENCE|MATHEMATICS.APPLIED</unknown> <unknown tag="mrcbT16-f">4.028</unknown> <unknown tag="mrcbT16-g">1.234</unknown> <unknown tag="mrcbT16-h">14.1</unknown> <unknown tag="mrcbT16-i">0.02247</unknown> <unknown tag="mrcbT16-j">2.961</unknown> <unknown tag="mrcbT16-k">10771</unknown> <unknown tag="mrcbT16-s">2.853</unknown> <unknown tag="mrcbT16-5">3.571</unknown> <unknown tag="mrcbT16-6">124</unknown> <unknown tag="mrcbT16-7">Q1</unknown> <unknown tag="mrcbT16-B">98.58</unknown> <unknown tag="mrcbT16-C">90.8</unknown> <unknown tag="mrcbT16-D">Q1*</unknown> <unknown tag="mrcbT16-E">Q1*</unknown> <unknown tag="mrcbT16-M">1.9</unknown> <unknown tag="mrcbT16-N">Q1</unknown> <unknown tag="mrcbT16-P">97.441</unknown> <arlyear>2018</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: adam-0474227.pdf </unknown>    <unknown tag="mrcbU14"> 85017593151 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000426071000010 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0257227 Mathematical Programming 0025-5610 1436-4646 Roč. 168 1-2 2018 229 259 Springer </unknown> </cas_special> </bibitem>