Abstract
Bilevel Optimization is a very challenging framework where two players (with different objectives) compete for the definition of the final solution. In this paper we address a generic mixed-integer bilevel linear program, i.e., a bilevel optimization problem where the objective functions and constraints are all linear, and some variables are required to take integer values. We briefly describe some main ingredients of a branch-and-cut general-purpose framework for the exact solution (under appropriate assumptions) of mixed-integer bilevel linear programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Balas, E.: Intersection cuts-a new type of cutting planes for integer programming. Op. Res. 19(1), 19–39 (1971)
Conforti, M., Cornuejols, G., Zambelli, G.: Integer Programming. Springer International Publishing (2014)
DeNegre, S.: Interdiction and discrete bilevel linear programming. In: PhD Thesis. Lehigh University (2011)
DeNegre, S., Ralphs, T.K.: A branch-and-cut algorithm for integer bilevel linear programs. In: Operations Research and Cyber-Infrastructure, pp. 65–78. Springer (2009)
Fischetti, M., Ljubić, I., Monaci, M., Sinnl, M.: Intersection cuts for bilevel optimization. In: Louveaux, Q., Skutella, M. (eds.) Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, Liège, Belgium, June 1–3, 2016, Proceedings, Springer International Publishing, pp. 77–88. (2016) (Extended version mathematical programming)
Fischetti, M., Ljubić, I., Monaci, M., Sinnl, M.: A new general-purpose algorithm for mixed-integer bilevel linear programs. Operations Research
Kleniati, P.-M., Adjiman, C.S.: A generalization of the branch-and-sandwich algorithm: from continuous to mixed-integer nonlinear bilevel problems. Comput. Chem. Eng. 72, 373–386 (2015)
Moore, J., Bard, J.: The mixed integer linear bilevel programming problem. Op. Res. 38(5), 911–921 (1990)
Ralphs, T.K.: MibS. https://github.com/tkralphs/MibS
Xu, P., Wang, L.: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions. Comput. Op. Res. 41, 309–318 (2014)
Acknowledgements
This research was partially supported by MiUR, Italy (PRIN2015 project) and by the Vienna Science and Technology Fund (WWTF) through project ICT15-014.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Fischetti, M. (2017). From Mixed-Integer Linear to Mixed-Integer Bilevel Linear Programming. In: Sforza, A., Sterle, C. (eds) Optimization and Decision Science: Methodologies and Applications. ODS 2017. Springer Proceedings in Mathematics & Statistics, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-319-67308-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-67308-0_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67307-3
Online ISBN: 978-3-319-67308-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)