IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v79y2021i1d10.1007_s10589-021-00266-7.html
   My bibliography  Save this article

A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure

Author

Listed:
  • Haodong Yu

    (Shanghai Lixin University of Accounting and Finance, PRC)

  • Jie Sun

    (National University of Singapore)

  • Yanjun Wang

    (Shanghai University of Finance and Economics, PRC)

Abstract

A computational method is developed for solving time consistent distributionally robust multistage stochastic linear programs with discrete distribution. The stochastic structure of the uncertain parameters is described by a scenario tree. At each node of this tree, an ambiguity set is defined by conditional moment constraints to guarantee time consistency. This method employs the idea of nested Benders decomposition that incorporates forward and backward steps. The backward steps solve some conic programming problems to approximate the cost-to-go function at each node, while the forward steps are used to generate additional trial points. A new framework of convergence analysis is developed to establish the global convergence of the approximation procedure, which does not depend on the assumption of polyhedral structure of the original problem. Numerical results of a practical inventory model are reported to demonstrate the effectiveness of the proposed method.

Suggested Citation

  • Haodong Yu & Jie Sun & Yanjun Wang, 2021. "A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure," Computational Optimization and Applications, Springer, vol. 79(1), pages 67-99, May.
    • Handle: RePEc:spr:coopap:v:79:y:2021:i:1:d:10.1007_s10589-021-00266-7
    DOI: 10.1007/s10589-021-00266-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-021-00266-7
    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-021-00266-7?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. Homem-de-Mello, Tito & Pagnoncelli, Bernardo K., 2016. "Risk aversion in multistage stochastic programming: A modeling and algorithmic perspective," European Journal of Operational Research, Elsevier, vol. 249(1), pages 188-199.
    2. Alexander Shapiro & Wajdi Tekaya & Murilo Pereira Soares & Joari Paulo da Costa, 2013. "Worst-Case-Expectation Approach to Optimization Under Uncertainty," Operations Research, INFORMS, vol. 61(6), pages 1435-1449, December.
    3. Andy Philpott & Vitor de Matos & Erlon Finardi, 2013. "On Solving Multistage Stochastic Programs with Coherent Risk Measures," Operations Research, INFORMS, vol. 61(4), pages 957-970, August.
    4. Tomasz R. Bielecki & Igor Cialenco & Marcin Pitera, 2016. "A survey of time consistency of dynamic risk measures and dynamic performance measures in discrete time: LM-measure perspective," Papers 1603.09030, arXiv.org, revised Jan 2017.
    5. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    6. Bansal, Manish & Mehrotra, Sanjay, 2019. "On solving two-stage distributionally robust disjunctive programs with a general ambiguity set," European Journal of Operational Research, Elsevier, vol. 279(2), pages 296-307.
    7. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    8. Michael S. Casey & Suvrajeet Sen, 2005. "The Scenario Generation Algorithm for Multistage Stochastic Linear Programming," Mathematics of Operations Research, INFORMS, vol. 30(3), pages 615-631, August.
    9. P. Girardeau & V. Leclere & A. B. Philpott, 2015. "On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 130-145, February.
    10. Philippe Artzner & Freddy Delbaen & Jean-Marc Eber & David Heath & Hyejin Ku, 2007. "Coherent multiperiod risk adjusted values and Bellman’s principle," Annals of Operations Research, Springer, vol. 152(1), pages 5-22, July.
    11. Ang, James & Meng, Fanwen & Sun, Jie, 2014. "Two-stage stochastic linear programs with incomplete information on uncertainty," European Journal of Operational Research, Elsevier, vol. 233(1), pages 16-22.
    12. Angelos Georghiou & Angelos Tsoukalas & Wolfram Wiesemann, 2019. "Robust Dual Dynamic Programming," Operations Research, INFORMS, vol. 67(3), pages 813-830, May.
    13. Ling, Aifan & Sun, Jie & Yang, Xiaoguang, 2014. "Robust tracking error portfolio selection with worst-case downside risk measures," Journal of Economic Dynamics and Control, Elsevier, vol. 39(C), pages 178-207.
    14. Tomasz R. Bielecki & Igor Cialenco & Marcin Pitera, 2014. "A unified approach to time consistency of dynamic risk measures and dynamic performance measures in discrete time," Papers 1409.7028, arXiv.org, revised Sep 2017.
    15. Guigues, Vincent, 2017. "Dual Dynamic Programing with cut selection: Convergence proof and numerical experiments," European Journal of Operational Research, Elsevier, vol. 258(1), pages 47-57.
    16. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    17. Bita Analui & Georg Pflug, 2014. "On distributionally robust multiperiod stochastic optimization," Computational Management Science, Springer, vol. 11(3), pages 197-220, July.
    18. Marcus Ang & Jie Sun & Qiang Yao, 2018. "On the dual representation of coherent risk measures," Annals of Operations Research, Springer, vol. 262(1), pages 29-46, March.
    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. Park, Jangho & Bayraksan, Güzin, 2023. "A multistage distributionally robust optimization approach to water allocation under climate uncertainty," European Journal of Operational Research, Elsevier, vol. 306(2), pages 849-871.

    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. Bakker, Hannah & Dunke, Fabian & Nickel, Stefan, 2020. "A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice," Omega, Elsevier, vol. 96(C).
    2. Park, Jangho & Bayraksan, Güzin, 2023. "A multistage distributionally robust optimization approach to water allocation under climate uncertainty," European Journal of Operational Research, Elsevier, vol. 306(2), pages 849-871.
    3. Yining Gu & Yicheng Huang & Yanjun Wang, 2024. "Data-Driven Distributionally Robust Risk-Averse Two-Stage Stochastic Linear Programming over Wasserstein Ball," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 242-279, January.
    4. Yang, Yongjian & Yin, Yunqiang & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Dhamotharan, Lalitha, 2023. "Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1042-1062.
    5. Wang, Fan & Zhang, Chao & Zhang, Hui & Xu, Liang, 2021. "Short-term physician rescheduling model with feature-driven demand for mental disorders outpatients," Omega, Elsevier, vol. 105(C).
    6. Alonso-Ayuso, Antonio & Escudero, Laureano F. & Guignard, Monique & Weintraub, Andres, 2018. "Risk management for forestry planning under uncertainty in demand and prices," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1051-1074.
    7. Strub, Moris S. & Li, Duan & Cui, Xiangyu & Gao, Jianjun, 2019. "Discrete-time mean-CVaR portfolio selection and time-consistency induced term structure of the CVaR," Journal of Economic Dynamics and Control, Elsevier, vol. 108(C).
    8. Yongchao Liu & Alois Pichler & Huifu Xu, 2019. "Discrete Approximation and Quantification in Distributionally Robust Optimization," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 19-37, February.
    9. Liu, Jia & Chen, Zhiping, 2018. "Time consistent multi-period robust risk measures and portfolio selection models with regime-switching," European Journal of Operational Research, Elsevier, vol. 268(1), pages 373-385.
    10. 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.
    11. Lorenzo Reus & Guillermo Alexander Sepúlveda-Hurtado, 2023. "Foreign exchange trading and management with the stochastic dual dynamic programming method," Financial Innovation, Springer;Southwestern University of Finance and Economics, vol. 9(1), pages 1-38, December.
    12. 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.
    13. Angelos Georghiou & Angelos Tsoukalas & Wolfram Wiesemann, 2019. "Robust Dual Dynamic Programming," Operations Research, INFORMS, vol. 67(3), pages 813-830, May.
    14. Thuener Silva & Davi Valladão & Tito Homem-de-Mello, 2021. "A data-driven approach for a class of stochastic dynamic optimization problems," Computational Optimization and Applications, Springer, vol. 80(3), pages 687-729, December.
    15. Tomasz R. Bielecki & Igor Cialenco & Marcin Pitera, 2018. "A Unified Approach to Time Consistency of Dynamic Risk Measures and Dynamic Performance Measures in Discrete Time," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 204-221, February.
    16. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    17. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    18. Tomasz R. Bielecki & Igor Cialenco & Shibi Feng, 2018. "A Dynamic Model of Central Counterparty Risk," Papers 1803.02012, arXiv.org.
    19. Xiaojiao Tong & Hailin Sun & Xiao Luo & Quanguo Zheng, 2018. "Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems," Journal of Global Optimization, Springer, vol. 70(1), pages 131-158, January.
    20. Tomasz R. Bielecki & Tao Chen & Igor Cialenco, 2020. "Time-inconsistent Markovian control problems under model uncertainty with application to the mean-variance portfolio selection," Papers 2002.02604, arXiv.org, revised Sep 2020.

    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:79:y:2021:i:1:d:10.1007_s10589-021-00266-7. 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.