Abstract
In this study, we consider the robust knapsack problem defined by the model of Bertsimas and Sim (Operations Research 52(1):35–53, 2004) where each item weight is uncertain and is defined with an interval. The problem is to choose a subset of items that is feasible for all of the cases in which up to a pre-specified number of items are allowed to take maximum weights simultaneously while maximizing the sum of profits of chosen items. Several integer optimization formulations for the problem have been proposed, however the strength of the upper bounds obtained from their LP-relaxations have not been theoretically analyzed and compared. In this paper, we establish a theoretical relationship among those formulations in terms of their LP-relaxations. Especially, we theoretically prove that previously proposed strong formulations (two extended formulations and a formulation using submodularity) yield the same LP-relaxation bound. In addition, through computational tests with benchmark instances, we analyze the trade-off between the strength of the lower bounds and the required computation time to solve the LP-relaxations. The results show that the formulation using submodularity shows competitive theoretical and computational performance.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Atamtürk, A. (2006). Strong formulations of robust mixed 0–1 programming. Mathematical Programming, 108(2), 235–250.
Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust Optimization. Princeton University Press.
Ben-Tal, A., & Nemirovski, A. (1999). Robust solutions of uncertain linear programs. Operations Research Letters, 25(1), 1–13.
Bertsimas, D., & Brown, D. B. (2009). Constructing uncertainty sets for robust linear optimization. Operations Research, 57(6), 1483–1495.
Bertsimas, D., Brown, D. B., & Caramanis, C. (2011). Theory and applications of robust optimization. SIAM Review, 53(3), 464–501.
Bertsimas, D., Gupta, V., & Kallus, N. (2018). Data-driven robust optimization. Mathematical Programming, 167(2), 235–292.
Bertsimas, D., & Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1), 49–71.
Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53.
Chassein, A., Dokka, T., & Goerigk, M. (2019). Algorithms and uncertainty sets for data-driven robust shortest path problems. European Journal of Operational Research, 274(2), 671–686.
Edmonds, J. (1970). Submodular functions, matroids, and certain polyhedra. In Combinatorial structures and their applications. New York: Gordon and Breach, pp. 11–26
Fischetti, M., & Monaci, M. (2012). Cutting plane versus compact formulations for uncertain (integer) linear programs. Mathematical Programming Computation, 4, 239–273.
Han, J., Lee, K., Lee, C., Choi, K.-S., & Park, S. (2016). Robust optimization approach for a chance-constrained binary knapsack problem. Mathematical Programming, 157(1), 277–296.
Joung, S., & Lee, K. (2020). Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity. Optimization Letters, 14(1), 101–113.
Joung, S., & Park, S. (2018). Lifting and separation of robust cover inequalities. Networks, 72(2), 272–305.
Joung, S., & Park, S. (2021). Robust mixed 0–1 programming and submodularity. INFORMS Journal on Optimization, 3(2), 183–199.
Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack Problems. Springer.
Klopfenstein, O., & Nace, D. (2008). A robust approach to the chance-constrained knapsack problem. Operations Research Letters, 36(5), 628–632.
Klopfenstein, O., & Nace, D. (2012). Cover inequalities for robust knapsack sets-application to the robust bandwidth packing problem. Networks, 59(1), 59–72.
Kutschka, M. (2013). Robustness concepts for knapsack and network design problems under data uncertainty. PhD thesis, RWTH Aachen University.
Lee, C., Lee, K., Park, K., & Park, S. (2012). Technical note-branch-and-price-and-cut approach to the robust network design problem without flow bifurcations. Operations Research, 60(3), 604–610.
Lee, T., & Kwon, C. (2014). A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty. 4OR, 12(4), 373–378.
Monaci, M., Pferschy, U., & Serafini, P. (2013). Exact solution of the robust knapsack problem. Computers & Operations Research, 40(11), 2625–2631.
Solyalı, O., Cordeau, J.-F., & Laporte, G. (2012). Robust inventory routing under demand uncertainty. Transportation Science, 46(3), 327–340.
Wolsey, L. A. (1998). Integer Programming (Vol. 42). Wiley.
Acknowledgements
This study was financially supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIT) (No. 2021R1G1A1003653).
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Joung, S., Oh, S. & Lee, K. Comparative analysis of linear programming relaxations for the robust knapsack problem. Ann Oper Res 323, 65–78 (2023). https://doi.org/10.1007/s10479-022-05161-w
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-022-05161-w