Number of the records: 1  

Optimality conditions for disjunctive programs with applications to mathematical programs with equilibrium constraints

  1. 1.
    SYSNO ASEP0392856
    Document TypeJ - Journal Article
    R&D Document TypeThe record was not marked in the RIV
    Subsidiary JČlánek ve WOS
    TitleOptimality conditions for disjunctive programs with applications to mathematical programs with equilibrium constraints
    Author(s) Flegel, M. L. (DE)
    Kanzow, Ch. (DE)
    Outrata, Jiří (UTIA-B) RID, ORCID
    Source TitleSet-Valued Analysis - ISSN 0927-6947
    Roč. 15, č. 2 (2007), s. 139-162
    Number of pages24 s.
    Publication formPrint - P
    Languageeng - English
    CountryNL - Netherlands
    Keywordsdisjunctive programs ; mathematical programs with equilibrium ; Guignard constraint qualification
    Subject RIVBA - General Mathematics
    R&D ProjectsIAA1075402 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    CEZAV0Z10750506 - UTIA-B (2005-2011)
    UT WOS000246185600003
    DOI10.1007/s11228-006-0033-5
    AnnotationWe consider optimization problems with a disjunctive structure of the feasible set. Using Guignard-type constraint qualifications for these optimization problems and exploiting some results for the limiting normal cone by Mordukhovich, we derive different optimality conditions. Furthermore, we specialize these results to mathematical programs with equilibrium constraints. In particular, we show that a new constraint qualification, weaker than any other constraint qualification used in the literature, is enough in order to show that a local minimum results in a so-called M-stationary point. Additional assumptions are also discussed which guarantee that such an M-stationary point is in fact a strongly stationary point.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2014
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.