Summary of LP-QP bilevel problems
Description of the Linear-Quadratic bilevel test problems: data and references
| Label | Source | n | m | F* | f* | x* | y* |
|---|---|---|---|---|---|---|---|
| mb_2006_01 | (Mitsos & Barton, 2006) | 0 | 1 | -1.000 | -1.000 | - | -1.000 |
| mb_2007_04 | (Mitsos & Barton, 2007) | 0 | 1 | 1.000 | -1.000 | - | 1.000 |
| mb_2007_03 | (Mitsos & Barton, 2007) | 0 | 1 | -1.000 | 1.000 | - | -1.000 |
| b_1991_02 | (Bard, 1991) | 1 | 2 | 2.000 | 12.000 | 2.000 | (6.000, 0.000) |
| as_1984_01 | (Aiyoshi & Shimizu, 1984) | 2 | 2 | 0.000 | 200.000 | (0.000, 0.000) | (-10.000, -10.000) |
| 0.000 | 100.000 | (0.000, 30.000) | (-10.000, 10.000) |
References
- E. Aiyoshi and K. Shimizu, A solution method for the static constrained Stackelberg problem via penalty method, IEEE Transactions on Automatic Control, 29 (1984), pp. 1111–1114
- J. F. Bard, Some properties of the bilevel programming problem, Journal of optimization theory and applications, 68 (1991), pp. 371–378
- A. Mitsos and P. I. Barton, Issues in the development of global optimization algorithms for bilevel programs with a nonconvex inner program, Technical report, Massachusetts Institute of Technology
- A. Mitsos and P. I. Barton, A Test Set for Bilevel Programs, 2007. Last updated September 19, 2007
