M. Labbé

A bilevel optimization problem consists of an optimization problem in which some of the constraints specify that a subset of variables must be an optimal solution to another optimization problem. This paradigm is particularly appropriate to model competition between agents, a leader, and a follower, acting sequentially. In this talk, I will focus on the simplest bilevel problems, those that are linear. I will present the main characteristics, properties, and algorithms for these problems. Then, I will discuss some recent results showing that these problems are already extremely challenging.

Keywords: Bilevel optimization


TA1-P1 Plenary. Linear bilevel optimization: overview and recent results
June 10, 2021  2:00 PM
1 - GB Dantzig

Latest news

  • 6/5/21
    Conference abstract book

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.