Abstract
Robust combinatorial optimization with budget uncertainty is one of the most popular approaches for integrating uncertainty in optimization problems. The existence of a compact reformulation for (mixed-integer) linear programs and positive complexity results give the impression that these problems are relatively easy to solve. However, the practical performance of the reformulation is actually quite poor when solving robust integer problems due to its weak linear relaxation.
To overcome the problems arising from the weak formulation, we propose a procedure to derive new classes of valid inequalities for robust binary optimization problems. For this, we recycle valid inequalities of the underlying deterministic problem such that the additional variables from the robust formulation are incorporated. The valid inequalities to be recycled may either be readily available model constraints or actual cutting planes, where we can benefit from decades of research on valid inequalities for classical optimization problems.
We first demonstrate the strength of the inequalities theoretically, by proving that recycling yields a facet-defining inequality in surprisingly many cases, even if the original valid inequality was not facet-defining. Afterwards, we show in a computational study that using recycled inequalities leads to a significant improvement of the computation time when solving robust optimization problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Achterberg, T.: Constraint integer programming. Ph.D. Thesis, Technische Universitat Berlin (2007)
Álvarez-Miranda, E., Ljubić, I., Toth, P.: A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR 11(4), 349–360 (2013)
Atamtürk, A.: Strong formulations of robust mixed 0–1 programming. Math. Program. 108(2–3), 235–250 (2006)
Bertsimas, D., Dunning, I., Lubin, M.: Reformulation versus cutting-planes for robust optimization. CMS 13(2), 195–217 (2016)
Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98(1–3), 49–71 (2003)
Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)
Büsing, C., Gersing, T., Koster, A.M.: A branch and bound algorithm for robust binary optimization with budget uncertainty. Math. Program. Comput. (2023). https://doi.org/10.1007/s12532-022-00232-2
Conforti, M., Cornuéjols, G., Zambelli, G., et al.: Integer Programming, vol. 271. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11008-0
Fischetti, M., Monaci, M.: Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Program. Comput. 4(3), 239–273 (2012)
Gersing, T.: Algorithms for robust binary optimization, December 2022. https://doi.org/10.5281/zenodo.7463371
Gersing, T., Büsing, C., Koster, A.: Benchmark Instances for Robust Combinatorial Optimization with Budgeted Uncertainty, December 2022. https://doi.org/10.5281/zenodo.7419028
Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3), 443–490 (2021). https://doi.org/10.1007/s12532-020-00194-3
Gurobi Optimization, LLC: Gurobi optimizer reference manual, version 9.5 (2022). http://www.gurobi.com
Hansknecht, C., Richter, A., Stiller, S.: Fast robust shortest path computations. In: 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)
Johnson, D.S., Trick, M.A.: Cliques, coloring, and satisfiability: second DIMACS implementation challenge, 11–13 October 1993, vol. 26. American Mathematical Society (1996)
Joung, S., Park, S.: Robust mixed 0–1 programming and submodularity. INFORMS J. Optim. 3(2), 183–199 (2021). https://doi.org/10.1287/ijoo.2019.0042
Lee, T., Kwon, C.: A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty. 4OR 12(4), 373–378 (2014)
Padberg, M.W.: On the facial structure of set packing polyhedra. Math. Program. 5(1), 199–215 (1973)
Park, K., Lee, K.: A note on robust combinatorial optimization problem. Manag. Sci. Financ. Eng. 13(1), 115–119 (2007)
Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer, New York (2013). https://doi.org/10.1007/978-1-4757-4388-3
Acknowledgements
This work was partially supported by the German Federal Ministry of Education and Research (grants no. 05M16PAA) within the project “HealthFaCT - Health: Facility Location, Covering and Transport”, the Freigeist-Fellowship of the Volkswagen Stiftung, and the German research council (DFG) Research Training Group 2236 UnRAVeL.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Büsing, C., Gersing, T., Koster, A.M.C.A. (2023). Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty. In: Del Pia, A., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization. IPCO 2023. Lecture Notes in Computer Science, vol 13904. Springer, Cham. https://doi.org/10.1007/978-3-031-32726-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-031-32726-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-32725-4
Online ISBN: 978-3-031-32726-1
eBook Packages: Computer ScienceComputer Science (R0)