Kleinert T, Manns J, Schmidt M, Weninger D (2021)
Publication Language: English
Publication Type: Journal article, Review article
Publication year: 2021
URI: http://www.optimization-online.org/DB_HTML/2021/03/8286.html
DOI: 10.1016/j.ejco.2021.100020
Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization. Thus, during the last years and decades many branch-and-bound methods, cutting planes, or heuristics have been proposed. On the other hand, there is almost no literature on presolving linear bilevel problems although presolve is a very important ingredient in state-of-the-art mixed-integer optimization solvers. In this paper, we carry over standard presolve techniques from single-level optimization to bilevel problems and show that this needs to be done with great caution since a naive application of well-known techniques does often not lead to correctly presolved bilevel models. Our numerical study shows that presolve can also be very beneficial for bilevel problems but also highlights that these methods have a more heterogeneous effect on the solution process compared to what is known from single-level optimization. As a side result, our numerical experiments reveal that there is an urgent need for better and more heterogeneous test instance libraries to further propel the field of computational bilevel optimization.
APA:
Kleinert, T., Manns, J., Schmidt, M., & Weninger, D. (2021). Presolving Linear Bilevel Optimization Problems. EURO Journal on Computational Optimization. https://dx.doi.org/10.1016/j.ejco.2021.100020
MLA:
Kleinert, Thomas, et al. "Presolving Linear Bilevel Optimization Problems." EURO Journal on Computational Optimization (2021).
BibTeX: Download