<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0410430</ARLID> <utime>20240103182213.5</utime><mtime>20060210235959.9</mtime>        <title language="eng" primary="1">On mathematical programs with complementarity constraints</title>  <specification> <page_count>21 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0254588</ARLID><ISSN>1055-6788</ISSN><title>Optimization Methods &amp; Software</title><part_num/><part_title/><volume_id>14</volume_id><volume>1 (2000)</volume><page_num>117-137</page_num><publisher><place/><name>Taylor &amp; Francis</name><year/></publisher></serial>   <author primary="1"> <ARLID>cav_un_auth*0101173</ARLID> <name1>Outrata</name1> <name2>Jiří</name2> <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>     <COSATI>12B</COSATI>    <cas_special> <project> <project_id>IAA1075707</project_id> <agency>GA AV</agency> <country>CZ</country> <ARLID>cav_un_auth*0012793</ARLID> </project> <research> <research_id>AV0Z1075907</research_id> </research>  <abstract language="eng" primary="1">The paper deals with mathematical programs, where a complementarity problem arises among the constraints. The main attention is paid to optimality conditions and the respective constraint qualification. In addition, a simple numerical approach is proposed based on the exact penalization of the complementarity constraint.</abstract>      <RIV>BB</RIV>   <department>MTR</department>    <permalink>http://hdl.handle.net/11104/0130519</permalink>   <ID_orig>UTIA-B 20000146</ID_orig>       <arlyear>2000</arlyear>       <unknown tag="mrcbU63"> cav_un_epca*0254588 Optimization Methods &amp; Software 1055-6788 1029-4937 Roč. 14 č. 1 2000 117 137 Taylor &amp; Francis </unknown> </cas_special> </bibitem>