IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v70y2018i1d10.1007_s10589-017-9974-x.html
   My bibliography  Save this article

A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides

Author

Listed:
  • Guanglin Xu

    (University of Iowa)

  • Samuel Burer

    (University of Iowa)

Abstract

We study two-stage adjustable robust linear programming in which the right-hand sides are uncertain and belong to a convex, compact uncertainty set. This problem is NP-hard, and the affine policy is a popular, tractable approximation. We prove that under standard and simple conditions, the two-stage problem can be reformulated as a copositive optimization problem, which in turn leads to a class of tractable, semidefinite-based approximations that are at least as strong as the affine policy. We investigate several examples from the literature demonstrating that our tractable approximations significantly improve the affine policy. In particular, our approach solves exactly in polynomial time a class of instances of increasing size for which the affine policy admits an arbitrarily large gap.

Suggested Citation

  • Guanglin Xu & Samuel Burer, 2018. "A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides," Computational Optimization and Applications, Springer, vol. 70(1), pages 33-59, May.
    • Handle: RePEc:spr:coopap:v:70:y:2018:i:1:d:10.1007_s10589-017-9974-x
    DOI: 10.1007/s10589-017-9974-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-017-9974-x
    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/s10589-017-9974-x?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. Amir Ardestani-Jaafari & Erick Delage, 2016. "Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems," Operations Research, INFORMS, vol. 64(2), pages 474-494, April.
    2. Gorissen, Bram L. & den Hertog, Dick, 2013. "Robust counterparts of inequalities containing sums of maxima of linear functions," European Journal of Operational Research, Elsevier, vol. 227(1), pages 30-43.
    3. Ben-Tal, Aharon & Chung, Byung Do & Mandala, Supreet Reddy & Yao, Tao, 2011. "Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1177-1189, September.
    4. Dimitris Bertsimas & Frans J. C. T. de Ruiter, 2016. "Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 500-511, August.
    5. Alper Atamtürk & Muhong Zhang, 2007. "Two-Stage Robust Network Flow and Design Under Demand Uncertainty," Operations Research, INFORMS, vol. 55(4), pages 662-673, August.
    6. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2016. "The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty," Management Science, INFORMS, vol. 62(4), pages 1188-1201, April.
    7. Aharon, Ben-Tal & Boaz, Golany & Shimrit, Shtern, 2009. "Robust multi-echelon multi-period inventory control," European Journal of Operational Research, Elsevier, vol. 199(3), pages 922-935, December.
    8. Aharon Ben-Tal & Boaz Golany & Arkadi Nemirovski & Jean-Philippe Vial, 2005. "Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach," Manufacturing & Service Operations Management, INFORMS, vol. 7(3), pages 248-271, February.
    9. Xin Chen & Yuhan Zhang, 2009. "Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts," Operations Research, INFORMS, vol. 57(6), pages 1469-1482, December.
    10. Fonseca, Raquel J. & Rustem, Berç, 2012. "International portfolio management with affine policies," European Journal of Operational Research, Elsevier, vol. 223(1), pages 177-187.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dimitris Bertsimas & Shimrit Shtern & Bradley Sturt, 2023. "A Data-Driven Approach to Multistage Stochastic Linear Optimization," Management Science, INFORMS, vol. 69(1), pages 51-74, January.
    2. Immanuel Bomze & Markus Gabl, 2021. "Interplay of non-convex quadratically constrained problems with adjustable robust optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 115-151, February.
    3. Ning Zhang & Chang Fang, 2020. "Saddle point approximation approaches for two-stage robust optimization problems," Journal of Global Optimization, Springer, vol. 78(4), pages 651-670, December.
    4. Angelos Georghiou & Angelos Tsoukalas & Wolfram Wiesemann, 2020. "A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization," Operations Research, INFORMS, vol. 68(2), pages 572-590, March.
    5. Angelos Georghiou & Daniel Kuhn & Wolfram Wiesemann, 2019. "The decision rule approach to optimization under uncertainty: methodology and applications," Computational Management Science, Springer, vol. 16(4), pages 545-576, October.
    6. Areesh Mittal & Can Gokalp & Grani A. Hanasusanto, 2020. "Robust Quadratic Programming with Mixed-Integer Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 201-218, April.
    7. Cheng Guo & Merve Bodur & Joshua A. Taylor, 2021. "Copositive Duality for Discrete Markets and Games," Papers 2101.05379, arXiv.org, revised Jan 2021.
    8. Abbas Khademi & Ahmadreza Marandi & Majid Soleimani-damaneh, 2024. "A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization," Journal of Global Optimization, Springer, vol. 89(3), pages 559-595, July.
    9. Omar El Housni & Vineet Goyal, 2021. "On the Optimality of Affine Policies for Budgeted Uncertainty Sets," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 674-711, May.
    10. Bomze, Immanuel M. & Gabl, Markus, 2023. "Optimization under uncertainty and risk: Quadratic and copositive approaches," European Journal of Operational Research, Elsevier, vol. 310(2), pages 449-476.
    11. Amir Ardestani-Jaafari & Erick Delage, 2021. "Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1138-1161, July.
    12. Jianzhe Zhen & Ahmadreza Marandi & Danique de Moor & Dick den Hertog & Lieven Vandenberghe, 2022. "Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2410-2427, September.

    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. Jianzhe Zhen & Ahmadreza Marandi & Danique de Moor & Dick den Hertog & Lieven Vandenberghe, 2022. "Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2410-2427, September.
    2. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    3. Angelos Georghiou & Angelos Tsoukalas & Wolfram Wiesemann, 2020. "A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization," Operations Research, INFORMS, vol. 68(2), pages 572-590, March.
    4. Metzker Soares, Paula & Thevenin, Simon & Adulyasak, Yossiri & Dolgui, Alexandre, 2024. "Adaptive robust optimization for lot-sizing under yield uncertainty," European Journal of Operational Research, Elsevier, vol. 313(2), pages 513-526.
    5. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2016. "The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty," Management Science, INFORMS, vol. 62(4), pages 1188-1201, April.
    6. Jiankun Sun & Jan A. Van Mieghem, 2019. "Robust Dual Sourcing Inventory Management: Optimality of Capped Dual Index Policies and Smoothing," Manufacturing & Service Operations Management, INFORMS, vol. 21(4), pages 912-931, October.
    7. Angelos Georghiou & Daniel Kuhn & Wolfram Wiesemann, 2019. "The decision rule approach to optimization under uncertainty: methodology and applications," Computational Management Science, Springer, vol. 16(4), pages 545-576, October.
    8. Hossein Hashemi Doulabi & Patrick Jaillet & Gilles Pesant & Louis-Martin Rousseau, 2021. "Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 143-162, January.
    9. Ning Zhang & Chang Fang, 2020. "Saddle point approximation approaches for two-stage robust optimization problems," Journal of Global Optimization, Springer, vol. 78(4), pages 651-670, December.
    10. Gorissen, Bram L. & den Hertog, Dick, 2013. "Robust counterparts of inequalities containing sums of maxima of linear functions," European Journal of Operational Research, Elsevier, vol. 227(1), pages 30-43.
    11. Filipe Rodrigues & Agostinho Agra & Cristina Requejo & Erick Delage, 2021. "Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 685-705, May.
    12. Hamed Mamani & Shima Nassiri & Michael R. Wagner, 2017. "Closed-Form Solutions for Robust Inventory Management," Management Science, INFORMS, vol. 63(5), pages 1625-1643, May.
    13. 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.
    14. Xie, Chen & Wang, Liangquan & Yang, Chaolin, 2021. "Robust inventory management with multiple supply sources," European Journal of Operational Research, Elsevier, vol. 295(2), pages 463-474.
    15. Christoph Buchheim & Jannis Kurtz, 2018. "Robust combinatorial optimization under convex and discrete cost uncertainty," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(3), pages 211-238, September.
    16. Amir Ardestani-Jaafari & Erick Delage, 2016. "Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems," Operations Research, INFORMS, vol. 64(2), pages 474-494, April.
    17. Haolin Ruan & Zhi Chen & Chin Pang Ho, 2023. "Adjustable Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1002-1023, September.
    18. Marcio Costa Santos & Michael Poss & Dritan Nace, 2018. "A perfect information lower bound for robust lot-sizing problems," Annals of Operations Research, Springer, vol. 271(2), pages 887-913, December.
    19. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    20. Yanıkoğlu, İhsan & Gorissen, Bram L. & den Hertog, Dick, 2019. "A survey of adjustable robust optimization," European Journal of Operational Research, Elsevier, vol. 277(3), pages 799-813.

    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:coopap:v:70:y:2018:i:1:d:10.1007_s10589-017-9974-x. 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.