IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v22y2025i2d10.1007_s10287-025-00542-5.html
   My bibliography  Save this article

Tree approximation of scenario processes for multistage stochastic optimization: algorithms and fast implementations

Author

Listed:
  • Kipngeno Benard Kirui

    (Technische Universität Chemnitz)

  • Georg Ch. Pflug

    (University of Vienna and International Institute for Applied System Analysis (IIASA))

  • Alois Pichler

    (Technische Universität Chemnitz)

Abstract

For solving multistage stochastic optimization problems it is essential to develop finite approximations of the stochastic process. While the goal is always to find a finite model which represents a given knowledge about the real data process as accurate as possible, the ways of estimating the discrete approximating model may be quite different: (1) if the stochastic model is known as a solution of a stochastic differential equation, e.g., one may generate the scenario tree directly from the specified model; (2) if a simulation algorithm is available, which allows simulating trajectories from all conditional distributions, a scenario tree can be generated by stochastic approximation; (3) if only some observed trajectories of the scenario process are available, the construction of the approximating process can be based on non-parametric conditional density estimates. We also elaborate on the important concept of distances, which allows us to assess the quality of the approximation. We study these methods and apply them to electricity price data. Our fast implementation ScenTrees.jl including an exhaustive documentation is available for free at GitHub (ScenTrees.jl: https://github.com/aloispichler/ScenTrees.jl , cf. Kirui et al. (J Open Sour Softw 5(46):1912, 2020)).

Suggested Citation

  • Kipngeno Benard Kirui & Georg Ch. Pflug & Alois Pichler, 2025. "Tree approximation of scenario processes for multistage stochastic optimization: algorithms and fast implementations," Computational Management Science, Springer, vol. 22(2), pages 1-37, December.
    • Handle: RePEc:spr:comgts:v:22:y:2025:i:2:d:10.1007_s10287-025-00542-5
    DOI: 10.1007/s10287-025-00542-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-025-00542-5
    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/s10287-025-00542-5?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Nils Löhndorf & David Wozabal & Stefan Minner, 2013. "Optimizing Trading Decisions for Hydro Storage Systems Using Approximate Dual Dynamic Programming," Operations Research, INFORMS, vol. 61(4), pages 810-823, August.
    2. Pieter Klaassen, 2002. "Comment on "Generating Scenario Trees for Multistage Decision Problems"," Management Science, INFORMS, vol. 48(11), pages 1512-1516, November.
    3. Vlad Bally & Gilles Pagès & Jacques Printems, 2005. "A Quantization Tree Method For Pricing And Hedging Multidimensional American Options," Mathematical Finance, Wiley Blackwell, vol. 15(1), pages 119-168, January.
    4. Ignacio Rios & Roger Wets & David Woodruff, 2015. "Multi-period forecasting and scenario generation with limited data," Computational Management Science, Springer, vol. 12(2), pages 267-295, April.
    5. Séguin, Sara & Fleten, Stein-Erik & Côté, Pascal & Pichler, Alois & Audet, Charles, 2017. "Stochastic short-term hydropower planning with inflow scenario trees," European Journal of Operational Research, Elsevier, vol. 259(3), pages 1156-1168.
    6. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    7. Wolfgang Härdle & Helmut Lütkepohl & Rong Chen, 1997. "A Review of Nonparametric Time Series Analysis," International Statistical Review, International Statistical Institute, vol. 65(1), pages 49-72, April.
    8. George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
    9. Kjetil Høyland & Stein W. Wallace, 2001. "Generating Scenario Trees for Multistage Decision Problems," Management Science, INFORMS, vol. 47(2), pages 295-307, February.
    10. Michal Kaut & Stein Wallace, 2011. "Shape-based scenario generation using copulas," Computational Management Science, Springer, vol. 8(1), pages 181-199, April.
    11. Holger Heitsch & Werner Römisch, 2009. "Scenario tree reduction for multistage stochastic programs," Computational Management Science, Springer, vol. 6(2), pages 117-133, May.
    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. Georg Pflug & Alois Pichler, 2015. "Dynamic generation of scenario trees," Computational Optimization and Applications, Springer, vol. 62(3), pages 641-668, December.
    2. Wu, Dexiang & Wu, Desheng Dash, 2020. "A decision support approach for two-stage multi-objective index tracking using improved lagrangian decomposition," Omega, Elsevier, vol. 91(C).
    3. Libo Yin & Liyan Han, 2013. "Options strategies for international portfolios with overall risk management via multi-stage stochastic programming," Annals of Operations Research, Springer, vol. 206(1), pages 557-576, July.
    4. Raimund Kovacevic & Alois Pichler, 2015. "Tree approximation for discrete time stochastic processes: a process distance approach," Annals of Operations Research, Springer, vol. 235(1), pages 395-421, December.
    5. Owadally, Iqbal & Jang, Chul & Clare, Andrew, 2021. "Optimal investment for a retirement plan with deferred annuities," Insurance: Mathematics and Economics, Elsevier, vol. 98(C), pages 51-62.
    6. Zhou, Feng & Huang, Gordon H. & Chen, Guo-Xian & Guo, Huai-Cheng, 2009. "Enhanced-interval linear programming," European Journal of Operational Research, Elsevier, vol. 199(2), pages 323-333, December.
    7. Trine K. Boomsma, 2019. "Comments on: A comparative study of time aggregation techniques in relation to power capacity-expansion modeling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(3), pages 406-409, October.
    8. Ankur Kulkarni & Uday Shanbhag, 2012. "Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms," Computational Optimization and Applications, Springer, vol. 51(1), pages 77-123, January.
    9. Yueyue Fan & Changzheng Liu, 2010. "Solving Stochastic Transportation Network Protection Problems Using the Progressive Hedging-based Method," Networks and Spatial Economics, Springer, vol. 10(2), pages 193-208, June.
    10. 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.
    11. Sodhi, ManMohan S. & Tang, Christopher S., 2009. "Modeling supply-chain planning under demand uncertainty using stochastic programming: A survey motivated by asset-liability management," International Journal of Production Economics, Elsevier, vol. 121(2), pages 728-738, October.
    12. Silvia Araújo dos Reis & José Eugenio Leal & Antônio Márcio Tavares Thomé, 2023. "A Two-Stage Stochastic Linear Programming Model for Tactical Planning in the Soybean Supply Chain," Logistics, MDPI, vol. 7(3), pages 1-26, August.
    13. Giovanni Pantuso & Trine K. Boomsma, 2020. "On the number of stages in multistage stochastic programs," Annals of Operations Research, Springer, vol. 292(2), pages 581-603, September.
    14. Sebastián Arpón & Tito Homem-de-Mello & Bernardo K. Pagnoncelli, 2020. "An ADMM algorithm for two-stage stochastic programming problems," Annals of Operations Research, Springer, vol. 286(1), pages 559-582, March.
    15. Chen, Chien-Wei & Fan, Yueyue, 2012. "Bioethanol supply chain system planning under supply and demand uncertainties," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 150-164.
    16. Topaloglou, Nikolas & Vladimirou, Hercules & Zenios, Stavros A., 2008. "A dynamic stochastic programming model for international portfolio management," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1501-1524, March.
    17. Michal Kaut & Stein Wallace, 2011. "Shape-based scenario generation using copulas," Computational Management Science, Springer, vol. 8(1), pages 181-199, April.
    18. Boris Defourny & Damien Ernst & Louis Wehenkel, 2013. "Scenario Trees and Policy Selection for Multistage Stochastic Programming Using Machine Learning," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 488-501, August.
    19. Wei Zhang & Kai Wang & Alexandre Jacquillat & Shuaian Wang, 2023. "Optimized Scenario Reduction: Solving Large-Scale Stochastic Programs with Quality Guarantees," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 886-908, July.
    20. Keles, Dogan & Dehler-Holland, Joris, 2022. "Evaluation of photovoltaic storage systems on energy markets under uncertainty using stochastic dynamic programming," Energy Economics, Elsevier, vol. 106(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:comgts:v:22:y:2025:i:2:d:10.1007_s10287-025-00542-5. 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.