4.5 Article

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs

Journal

OPERATIONS RESEARCH
Volume 65, Issue 6, Pages 1615-1637

Publisher

INFORMS
DOI: 10.1287/opre.2017.1650

Keywords

bilevel optimization; mixed-integer programming; cutting planes; intersection cuts; branch and cut; computational analysis

Funding

  1. Vienna Science and Technology Fund (WWTF) [ICT15-014]
  2. University of Padova (Progetto di Ateneo Exploiting randomness in Mixed Integer Linear Programming)
  3. MiUR, Italy (PRIN project Mixed-Integer Nonlinear Optimization: Approaches and Applications)
  4. Austrian Research Fund (FWF) [P 26755-N19]
  5. Austrian Science Fund (FWF) [P26755] Funding Source: Austrian Science Fund (FWF)

Ask authors/readers for more resources

Bilevel optimization problems are very challenging optimization models arising in many important practical contexts, including pricing mechanisms in the energy sector, airline and telecommunication industry, transportation networks, critical infrastructure defense, and machine learning. In this paper, we consider bilevel programs with continuous and discrete variables at both levels, with linear objectives and constraints (continuous upper level variables, if any, must not appear in the lower level problem). We propose a general-purpose branch-and-cut exact solution method based on several new classes of valid inequalities, which also exploits a very effective bilevel-specific preprocessing procedure. An extensive computational study is presented to evaluate the performance of various solution methods on a common testbed of more than 800 instances from the literature and 60 randomly generated instances. Our new algorithm consistently outperforms (often by a large margin) alternative state-of-the-art methods from the literature, including methods exploiting problem-specific information for special instance classes. In particular, it solves to optimality more than 300 previously unsolved instances from the literature. To foster research on this challenging topic, our solver is made publicly available online.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available