Algorithms for Linear Bilevel Optimization

Herminia I. Calvete () and Carmen Galé ()
Additional contact information
Herminia I. Calvete: IUMA, University of Zaragoza
Carmen Galé: IUMA, University of Zaragoza

Chapter Chapter 10 in Bilevel Optimization, 2020, pp 293-312 from Springer

Abstract: Abstract This chapter addresses the linear bilevel optimization problem in which all the functions involved are linear. First, some remarks are made about the formulation of the problem, the difficulties which can arise when defining the concept of feasible solution or when proving the existence of optimal solution, and about its computational complexity. Then, the chapter focuses on the main algorithms proposed in the literature for solving the linear bilevel optimization problem. Most of them are exact algorithms, with only a few applying metaheuristic techniques. In this chapter, both kind of algorithms are reviewed according to the underlying idea that justifies them.

Keywords: Linear bilevel programming; Enumerative algorithms; Karush-Kuhn-Tucker conditions; Metaheuristic algorithms (search for similar items in EconPapers)
Date: 2020
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:spochp:978-3-030-52119-6_10

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

DOI: 10.1007/978-3-030-52119-6_10

Access Statistics for this chapter

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