Bilevel Programming

Stephan Dempe

Chapter Chapter 6 in Essays and Surveys in Global Optimization, 2005, pp 165-193 from Springer

Abstract: Abstract Bilevel programming problems are hierarchical optimization problems where an objective function is minimized over the graph of the solution set mapping of a parametric optimization problem. In this paper, a selective survey for this living research area is given. Focus is on main recent approaches to solve such problems, on optimality conditions as well as on essential features of this problem class.

Keywords: Bilevel Programming; Local Optimal Solution; Equilibrium Constraint; Lower Level Problem; Sufficient Optimality Condition (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-25570-5_6

Ordering information: This item can be ordered from
http://www.springer.com/9780387255705

DOI: 10.1007/0-387-25570-2_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().