Bilevel programming: A survey

By Benoît Colson, Patrice Marcotte, Gilles Savard. 4OR, 2005

513 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Economics and Econometrics, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/c2515f603348fe80fff5028bf46949058e0a2de4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Patrice Marcotte
2. Gilles Savard
3. Benoît Colson
4. Balaji Lakshminarayanan
5. Xiaojin Zhu
6. Shike Mei
7. Antonio J. Conejo
8. Shakir Mohamed

In Economics and Econometrics

1. Patrice Marcotte
2. Gilles Savard
3. Benoît Colson

In Numerical Analysis

1. Patrice Marcotte
2. Gilles Savard
3. Benoît Colson
4. Balaji Lakshminarayanan
5. Xiaojin Zhu
6. Shike Mei
7. Antonio J. Conejo
8. Yulia Tsvetkov

Citations in the corpus

• An overview of bilevel optimization (2007, methodology): “The algorithm in Colson et al. (2005a) is an iterative method which, given the current iterate or incumbent solution (x̄, ȳ), is based on the linear-quadratic bilevel model min x∈X,y Fm(x, y) s.t. Gm(x) ≤ 0, (3.10) min y fm(x, y) s.t. gm(x, y) ≤ 0, of problem (2.1), where Fm, Gm and gm are linear…”