IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v323y2023i1d10.1007_s10479-022-05161-w.html
   My bibliography  Save this article

Comparative analysis of linear programming relaxations for the robust knapsack problem

Author

Listed:
  • Seulgi Joung

    (Chonnam National University)

  • Seyoung Oh

    (Seoul National University)

  • Kyungsik Lee

    (Seoul National University)

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.

Suggested Citation

  • Seulgi Joung & Seyoung Oh & Kyungsik Lee, 2023. "Comparative analysis of linear programming relaxations for the robust knapsack problem," Annals of Operations Research, Springer, vol. 323(1), pages 65-78, April.
    • Handle: RePEc:spr:annopr:v:323:y:2023:i:1:d:10.1007_s10479-022-05161-w
    DOI: 10.1007/s10479-022-05161-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05161-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-022-05161-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    2. Chungmok Lee & Kyungsik Lee & Kyungchul Park & Sungsoo Park, 2012. "Technical Note---Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations," Operations Research, INFORMS, vol. 60(3), pages 604-610, June.
    3. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2012. "Robust Inventory Routing Under Demand Uncertainty," Transportation Science, INFORMS, vol. 46(3), pages 327-340, August.
    4. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    5. Dimitris Bertsimas & David B. Brown, 2009. "Constructing Uncertainty Sets for Robust Linear Optimization," Operations Research, INFORMS, vol. 57(6), pages 1483-1495, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    2. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    3. Baringo, Luis & Boffino, Luigi & Oggioni, Giorgia, 2020. "Robust expansion planning of a distribution system with electric vehicles, storage and renewable units," Applied Energy, Elsevier, vol. 265(C).
    4. Zhang, Jie & Xie, Weijun & Sarin, Subhash C., 2021. "Robust multi-product newsvendor model with uncertain demand and substitution," European Journal of Operational Research, Elsevier, vol. 293(1), pages 190-202.
    5. Enrico Bartolini & Dominik Goeke & Michael Schneider & Mengdie Ye, 2021. "The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty," Transportation Science, INFORMS, vol. 55(2), pages 371-394, March.
    6. Sun, Hao & Yang, Jun & Yang, Chao, 2019. "A robust optimization approach to multi-interval location-inventory and recharging planning for electric vehicles," Omega, Elsevier, vol. 86(C), pages 59-75.
    7. Mehdi Ansari & Juan S. Borrero & Leonardo Lozano, 2023. "Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 83-103, January.
    8. Pengyu Qian & Zizhuo Wang & Zaiwen Wen, 2015. "A Composite Risk Measure Framework for Decision Making under Uncertainty," Papers 1501.01126, arXiv.org.
    9. Aharon Ben-Tal & Dimitris Bertsimas & David B. Brown, 2010. "A Soft Robust Model for Optimization Under Ambiguity," Operations Research, INFORMS, vol. 58(4-part-2), pages 1220-1234, August.
    10. Viktoryia Buhayenko & Dick den Hertog, 2017. "Adjustable Robust Optimisation approach to optimise discounts for multi-period supply chain coordination under demand uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 55(22), pages 6801-6823, November.
    11. Chassein, André & Goerigk, Marc, 2018. "Variable-sized uncertainty and inverse problems in robust optimization," European Journal of Operational Research, Elsevier, vol. 264(1), pages 17-28.
    12. Markov, Iliya & Bierlaire, Michel & Cordeau, Jean-François & Maknoon, Yousef & Varone, Sacha, 2018. "A unified framework for rich routing problems with stochastic demands," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 213-240.
    13. Jornada, Daniel & Leon, V. Jorge, 2016. "Robustness methodology to aid multiobjective decision making in the electricity generation capacity expansion problem to minimize cost and water withdrawal," Applied Energy, Elsevier, vol. 162(C), pages 1089-1108.
    14. Álvarez-Miranda, Eduardo & Ljubić, Ivana & Toth, Paolo, 2013. "Exact approaches for solving robust prize-collecting Steiner tree problems," European Journal of Operational Research, Elsevier, vol. 229(3), pages 599-612.
    15. Jornada, Daniel & Leon, V. Jorge, 2016. "Biobjective robust optimization over the efficient set for Pareto set reduction," European Journal of Operational Research, Elsevier, vol. 252(2), pages 573-586.
    16. Andrew J. Keith & Darryl K. Ahner, 2021. "A survey of decision making and optimization under uncertainty," Annals of Operations Research, Springer, vol. 300(2), pages 319-353, May.
    17. Claire Nicolas & Stéphane Tchung-Ming & Emmanuel Hache, 2016. "Energy transition in transportation under cost uncertainty, an assessment based on robust optimization," Working Papers hal-02475943, HAL.
    18. Algo Carè & Simone Garatti & Marco C. Campi, 2014. "FAST---Fast Algorithm for the Scenario Technique," Operations Research, INFORMS, vol. 62(3), pages 662-671, June.
    19. Claudio Arbib & Fabrizio Marinelli & Mustafa Ç. Pınar & Andrea Pizzuti, 2022. "Robust stock assortment and cutting under defects in automotive glass production," Production and Operations Management, Production and Operations Management Society, vol. 31(11), pages 4154-4172, November.
    20. Marla, Lavanya & Rikun, Alexander & Stauffer, Gautier & Pratsini, Eleni, 2020. "Robust modeling and planning: Insights from three industrial applications," Operations Research Perspectives, Elsevier, vol. 7(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:323:y:2023:i:1:d:10.1007_s10479-022-05161-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.