Bilevel Discrete Optimisation: Computational Complexity and Applications

Yury Kochetov (), Alexander Plyasunov () and Arteam Panin ()
Additional contact information
Yury Kochetov: Sobolev Institute of Mathematics
Alexander Plyasunov: Sobolev Institute of Mathematics
Arteam Panin: Sobolev Institute of Mathematics

Chapter Chapter 1 in The Palgrave Handbook of Operations Research, 2022, pp 3-42 from Springer

Abstract: Abstract Bilevel optimisation is an important class of hierarchical optimisation problems with two decision-makers: the leader and the follower. The leader cannot control the follower’s decisions but can change his constraints and the objective function. The goal or profit of the leader depends on the optimal decision of the follower. Over the last 30 years, the bilevel problems have received significant attention from the mathematical programming and operational research communities. This chapter provides an overview of bilevel discrete optimisation including basic definitions, properties, relationships to other classes of optimisation problems and applications, computational and approximation complexity. We aim to encourage researchers to pay more attention to this interesting area both from the theoretical point of view and applications.

Date: 2022
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-3-030-96935-6_1

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

DOI: 10.1007/978-3-030-96935-6_1

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