Skip to main content
Log in

On using cardinality constrained uncertainty for objective coefficients in robust optimization

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

Abstract

In this paper, we discuss the issues of using the cardinality constrained approach, proposed by Bertsimas and Sim (2004), for uncertain objective coefficients in robust optimization. For a special case of a single constraint, we state the necessary and sufficient condition to avoid one of the issues. We also suggest a new robust model that does not suffer from the issues, while preserving the merits of using the cardinality constrained uncertainty.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88(3), 411–424 (2000)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Bertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Oper. Res. Lett. 32(6), 510–516 (2004)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Esfahani, P.M., Kuhn, D.: Data-driven distributionally robust optimization using the wasserstein metric: performance guarantees and tractable reformulations. Math. Program. 171(1–2), 115–166 (2018)

    Article  MathSciNet  Google Scholar 

  7. 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 

  8. Li, J.Y., Kwon, R.H.: Portfolio selection under model uncertainty: a penalized moment-based optimization approach. J. Glob. Optim. 56(1), 131–164 (2013)

    Article  MathSciNet  Google Scholar 

  9. Liu, P., Yang, W., Guo, T.: A discussion on the conservatism of robust linear optimization problems. Optimization 65(8), 1641–1650 (2016)

    Article  MathSciNet  Google Scholar 

  10. Namkoong, H., Duchi, J.C.: Stochastic gradient methods for distributionally robust optimization with f-divergences. In: Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems, pp. 2208–2216 (2016)

  11. Rahimian, H., Mehrotra, S.: Distributionally robust optimization: A review. arXiv preprint arXiv:1908.05659 (2019)

  12. Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5), 1154–1157 (1973)

    Article  MathSciNet  Google Scholar 

  13. Thiele, A.: A note on issues of over-conservatism in robust optimization with cost uncertainty. Optimization 59(7), 1033–1040 (2010)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Research Foundation of Korea(NRF) Grant funded by the Korea government(MSIP) (No. 2016R1A2B4013590)

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sungsoo Park.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lim, J., Park, S. On using cardinality constrained uncertainty for objective coefficients in robust optimization. Optim Lett 15, 1195–1214 (2021). https://doi.org/10.1007/s11590-020-01622-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-020-01622-y

Keywords

Navigation