Skip to main content

Advertisement

SpringerLink
Log in

A new sequential lifting of robust cover inequalities

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We propose a new sequential lifting algorithm for robust cover inequalities by extending a recent lifting procedure for the deterministic case. In the proposed algorithm, the coefficients of some items in the robust cover are also lifted. The lifting subproblem is defined as a special case of the robust knapsack problem with generalized upper bounds. We present a dynamic programming algorithm to solve the subproblem in polynomial time. The computational results applied to the robust bandwidth packing problem show the effectiveness of the proposed lifting approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Data availability

The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.

References

  1. Atamtürk, A., Muller, L.F., Pisinger, D.: Separation and extension of cover inequalities for conic quadratic knapsack constraints with generalized upper bounds. INFORMS J. Comput. 25(3), 420–431 (2013)

    Article  MathSciNet  Google Scholar 

  2. Atamtürk, A., Narayanan, V.: The submodular knapsack polytope. Dis. Opt. 6(4), 333–344 (2009)

    Article  MathSciNet  Google Scholar 

  3. Balas, E.: Facets of the knapsack polytope. Math. Program. 8(1), 146–164 (1975)

    Article  MathSciNet  Google Scholar 

  4. Balas, E., Zemel, E.: Facets of the knapsack polytope from minimal covers. SIAM J. Appl. Math. 34(1), 119–148 (1978)

    Article  MathSciNet  Google Scholar 

  5. Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Opt. Princeton University Press, Princeton (2009)

    Book  Google Scholar 

  6. Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1–13 (1999)

    Article  MathSciNet  Google Scholar 

  7. Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464–501 (2011)

    Article  MathSciNet  Google Scholar 

  8. Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98(1), 49–71 (2003)

    Article  MathSciNet  Google Scholar 

  9. Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)

    Article  MathSciNet  Google Scholar 

  10. Caserta, M., Voß, S.: The robust multiple-choice multidimensional knapsack problem. Omega 86, 16–27 (2019)

    Article  Google Scholar 

  11. Castro, M. P., Cire, A. A., Beck J. C.: A combinatorial cut-and-lift procedure with an application to 0–1 second-order conic programming. Math. Program., pp. 1–57 (2021)

  12. Dehghani Filabadi, M., Mahmoudzadeh, H.: Effective budget of uncertainty for classes of robust optimization. INFORMS J. Opt. 4(3), 249–277 (2022)

    Article  MathSciNet  Google Scholar 

  13. Gabrel, V., Murat, C., Thiele, A.: Recent advances in robust optimization: an overview. Eur. J. Oper. Res. 235(3), 471–483 (2014)

    Article  MathSciNet  Google Scholar 

  14. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.: Lifted cover inequalities for 0–1 integer programs: computation. INFORMS J. Comput. 10(4), 427–437 (1998)

    Article  MathSciNet  Google Scholar 

  15. Han, J., Lee, K., Lee, C., Choi, K.-S., Park, S.: Robust optimization approach for a chance-constrained binary knapsack problem. Math. Program. 157, 277–296 (2016)

    Article  MathSciNet  Google Scholar 

  16. Joung, S., Park, S.: Lifting of probabilistic cover inequalities. Oper. Res. Lett. 45(5), 513–518 (2017)

    Article  MathSciNet  Google Scholar 

  17. Joung, S., Park, S.: Lifting and separation of robust cover inequalities. Networks 72(2), 272–305 (2018)

    Article  MathSciNet  Google Scholar 

  18. Klopfenstein, O., Nace, D.: A robust approach to the chance-constrained knapsack problem. Oper. Res. Lett. 36(5), 628–632 (2008)

    Article  MathSciNet  Google Scholar 

  19. Klopfenstein, O., Nace, D.: Cover inequalities for robust knapsack sets-application to the robust bandwidth packing problem. Networks 59(1), 59–72 (2012)

    Article  MathSciNet  Google Scholar 

  20. Kutschka, M.: Robustness concepts for knapsack and network design problems under data uncertainty. PhD thesis. RWTH Aachen University (2013)

  21. Lee, C., Lee, K., Park, K., Park, S.: Technical note-branch-and-price-and-cut approach to the robust network design problem without flow bifurcations. Oper. Res. 60(3), 604–610 (2012)

    Article  MathSciNet  Google Scholar 

  22. Letchford, A.N., Souli, G.: On lifted cover inequalities: a new lifting procedure with unusual properties. Oper. Res. Lett. 47(2), 83–87 (2019)

    Article  MathSciNet  Google Scholar 

  23. Minoux, M.: Robust linear programming with right-handside uncertainty, duality and applications. Encycl. Opt., pp. 3317–3327, (2009)

  24. Minoux, M.: Two-stage robust lp with ellipsoidal right-hand side uncertainty is np-hard. Opt. Lett. 6, 1463–1475 (2012)

    Article  MathSciNet  Google Scholar 

  25. Monaci, M., Pferschy, U., Serafini, P.: Exact solution of the robust knapsack problem. Comput. Oper. Res. 40(11), 2625–2631 (2013)

    Article  MathSciNet  Google Scholar 

  26. Ouorou, A.: Robust models for linear programming with uncertain right hand side. Networks 68(3), 200–211 (2016)

    Article  MathSciNet  Google Scholar 

  27. Park, K.-C.: Cover inequalities for the robust knapsack problem. Manage. Sci. Financial Eng. 14(1), 91–96 (2008)

    Google Scholar 

  28. Song, Y., Luedtke, J.R., Küçükyavuz, S.: Chance-constrained binary packing problems. INFORMS J. Comput. 26(4), 735–747 (2014)

    Article  MathSciNet  Google Scholar 

  29. Wolsey, L.A.: Faces for a linear inequality in 0–1 variables. Math. Program. 8(1), 165–178 (1975)

    Article  MathSciNet  Google Scholar 

  30. Zemel, E.: Easily computable facets of the knapsack polytope. Math. Oper. Res. 14(4), 760–764 (1989)

    Article  MathSciNet  Google Scholar 

Download references

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

  1. Department of Industrial Engineering, Chonnam National University, 77, Yongbong-ro, Buk-gu, Gwangju, 61186, Republic of Korea

    Seulgi Joung

Authors
  1. Seulgi Joung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seulgi Joung.

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.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Joung, S. A new sequential lifting of robust cover inequalities. Optim Lett 18, 925–941 (2024). https://doi.org/10.1007/s11590-023-02027-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-023-02027-3

Keywords

Search

Navigation