Abstract
The exact solution of bilevel optimization problems is a very challenging task that received more and more attention in recent years, as witnessed by the flourishing recent literature on this topic. In this paper we present ideas and algorithms to solve to proven optimality generic Mixed-Integer Bilevel Linear Programs (MIBLP’s) where all constraints are linear, and some/all variables are required to take integer values. In doing so, we look for a general-purpose approach applicable to any MIBLP (under mild conditions), rather than ad-hoc methods for specific cases. Our approach concentrates on minimal additions required to convert an effective branch-and-cut MILP exact code into a valid MIBLP solver, thus inheriting the wide arsenal of MILP tools (cuts, branching rules, heuristics) available in modern solvers.
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
Audet, C., Haddad, J., Savard, G.: Disjunctive cuts for continuous linear bilevel programming. Optimization Letters 1(3), 259–267 (2007)
Balas, E.: Intersection cuts-a new type of cutting planes for integer programming. Oper. Res. 19(1), 19–39 (1971)
Caramia, M., Mari, R.: Enhanced exact algorithms for discrete bilevel linear problems. Optimization Letters 9(7), 1447–1468 (2015)
DeNegre, S.: Interdiction and Discrete Bilevel Linear Programming. Ph.D. thesis, Lehigh University (2011)
DeNegre, S., Ralphs, T.K.: A branch-and-cut algorithm for integer bilevel linear programs. In: Chinneck, J.W., Kristjansson, B., Saltzman, M.J. (eds.) Operations Research and Cyber-Infrastructure, vol. 47, pp. 65–78. Springer, New York (2009)
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. Oper. 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. Oper. Res. 41, 309–318 (2014)
Acknowledgment
This research was funded by the Vienna Science and Technology Fund (WWTF) through project ICT15-014. The work of M. Fischetti and M. Monaci was also supported by the University of Padova (Progetto di Ateneo “Exploiting randomness in Mixed Integer Linear Programming”), and by MiUR, Italy (PRIN project “Mixed-Integer Nonlinear Optimization: Approaches and Applications”). The work of I. Ljubić and M. Sinnl was also supported by the Austrian Research Fund (FWF, Project P 26755-N19). The authors thank Ted Ralphs for his technical support and instructions regarding MibS, and Massimiliano Caramia for providing the instances used in [3].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Fischetti, M., Ljubić, I., Monaci, M., Sinnl, M. (2016). Intersection Cuts for Bilevel Optimization. In: Louveaux, Q., Skutella, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 2016. Lecture Notes in Computer Science(), vol 9682. Springer, Cham. https://doi.org/10.1007/978-3-319-33461-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-33461-5_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33460-8
Online ISBN: 978-3-319-33461-5
eBook Packages: Computer ScienceComputer Science (R0)