Optimality conditions for bilevel programming problems

Focus in the article is on necessary optimality conditions for bilevel programming problems. We first identify approaches that seem to be promising. Then, two such approaches are investigated. Using the nonexistence of a descent direction for the objective function within the tangent cone to the fea...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Optimization Ročník 55; číslo 5-6; s. 505 - 524
Hlavní autori: Dempe, S., Dutta, J., Lohse, S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia Taylor & Francis Group 01.10.2006
Taylor & Francis LLC
Predmet:
Bilevel programming
Hierarchies
Mathematical programming
Mathematics Subject Classifications 2000: 90C46
Necessary and sufficient optimality conditions
Optimization
Studies
Vector space
ISSN:0233-1934, 1029-4945
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Focus in the article is on necessary optimality conditions for bilevel programming problems. We first identify approaches that seem to be promising. Then, two such approaches are investigated. Using the nonexistence of a descent direction for the objective function within the tangent cone to the feasible set as necessary optimality condition we need efficient ways to describe this tangent cone. We describe possibilities for this in three different special cases. We conclude this article with the second approach applying Mordukhovich's coderivative to an appropriately reformulated bilevel programming problem.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0233-1934
1029-4945
DOI:10.1080/02331930600816189