Bilevel Programming: A Combinatorial Perspective

Patrice Marcotte and Gilles Savard

Chapter Chapter 7 in Graph Theory and Combinatorial Optimization, 2005, pp 191-217 from Springer

Abstract: Abstract Bilevel programming is a branch of optimization where a subset of variables is constrained to lie in the optimal set of an auxiliary mathematical prograri. This chapter presents an overview of two specific classes cf bilevel programs, and in particular their relationship to well-known combinatorial problems.

Keywords: Travel Salesman Problem; Bilevel Program; Truth Assignment; Equilibrium Constraint; Lower Level Problem (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (5)

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-25592-7_7

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

DOI: 10.1007/0-387-25592-3_7

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 ().