IDEAS home Printed from https://ideas.repec.org/a/spr/rvmgts/v18y2024i7d10.1007_s11846-024-00733-5.html
   My bibliography  Save this article

Approximation of multistage stochastic programming problems by smoothed quantization

Author

Listed:
  • Martin Šmíd

    (Czech Academy of Sciences, Institute of Information Theory and Automation)

  • Václav Kozmík

    (Czech Academy of Sciences, Institute of Information Theory and Automation
    Charles University in Prague, Faculty of Mathematics and Physics)

Abstract

We present an approximation technique for solving multistage stochastic programming problems with an underlying Markov stochastic process. This process is approximated by a discrete skeleton process, which is consequently smoothed down by means of the original unconditional distribution. Approximated in this way, the problem is solvable by means of Markov Stochastic Dual Dynamic Programming. We state an upper bound for the nested distance between the exact process and its approximation and discuss its convergence in the one-dimensional case. We further propose an adjustment of the approximation, which guarantees that the approximate problem is bounded. Finally, we apply our technique to a real-life production-emission trading problem and demonstrate the performance of its approximation given the “true” distribution of the random parameters.

Suggested Citation

  • Martin Šmíd & Václav Kozmík, 2024. "Approximation of multistage stochastic programming problems by smoothed quantization," Review of Managerial Science, Springer, vol. 18(7), pages 2079-2114, July.
    • Handle: RePEc:spr:rvmgts:v:18:y:2024:i:7:d:10.1007_s11846-024-00733-5
    DOI: 10.1007/s11846-024-00733-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11846-024-00733-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/s11846-024-00733-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 search for a different version of it.

    References listed on IDEAS

    as
    1. Cavagnini, Rossana & Bertazzi, Luca & Maggioni, Francesca, 2022. "A rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment," European Journal of Operational Research, Elsevier, vol. 301(3), pages 912-922.
    2. 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.
    3. Z. L. Chen & W. B. Powell, 1999. "Convergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse," Journal of Optimization Theory and Applications, Springer, vol. 102(3), pages 497-524, September.
    4. Birge, John R. & Louveaux, Francois V., 1988. "A multicut algorithm for two-stage stochastic linear programs," European Journal of Operational Research, Elsevier, vol. 34(3), pages 384-392, March.
    5. Kreitmeier, Wolfgang, 2011. "Optimal vector quantization in terms of Wasserstein distance," Journal of Multivariate Analysis, Elsevier, vol. 102(8), pages 1225-1239, September.
    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. K. Linowsky & A. B. Philpott, 2005. "On the Convergence of Sampling-Based Decomposition Algorithms for Multistage Stochastic Programs," Journal of Optimization Theory and Applications, Springer, vol. 125(2), pages 349-366, May.
    8. Julia L. Higle & Suvrajeet Sen, 1991. "Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse," Mathematics of Operations Research, INFORMS, vol. 16(3), pages 650-669, August.
    9. Güzin Bayraksan & David P. Morton, 2011. "A Sequential Sampling Procedure for Stochastic Programming," Operations Research, INFORMS, vol. 59(4), pages 898-913, August.
    10. Philippe Artzner & Freddy Delbaen & Jean‐Marc Eber & David Heath, 1999. "Coherent Measures of Risk," Mathematical Finance, Wiley Blackwell, vol. 9(3), pages 203-228, July.
    11. Rockafellar, R. Tyrrell & Uryasev, Stanislav, 2002. "Conditional value-at-risk for general loss distributions," Journal of Banking & Finance, Elsevier, vol. 26(7), pages 1443-1471, July.
    12. John R. Birge, 1985. "Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs," Operations Research, INFORMS, vol. 33(5), pages 989-1007, October.
    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. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    2. de Queiroz, Anderson Rodrigo, 2016. "Stochastic hydro-thermal scheduling optimization: An overview," Renewable and Sustainable Energy Reviews, Elsevier, vol. 62(C), pages 382-395.
    3. Davi Valladão & Thuener Silva & Marcus Poggi, 2019. "Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns," Annals of Operations Research, Springer, vol. 282(1), pages 379-405, November.
    4. Wim Ackooij & Welington Oliveira & Yongjia Song, 2019. "On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems," Computational Optimization and Applications, Springer, vol. 74(1), pages 1-42, September.
    5. N. Edirisinghe & E. Patterson, 2007. "Multi-period stochastic portfolio optimization: Block-separable decomposition," Annals of Operations Research, Springer, vol. 152(1), pages 367-394, July.
    6. Weini Zhang & Hamed Rahimian & Güzin Bayraksan, 2016. "Decomposition Algorithms for Risk-Averse Multistage Stochastic Programs with Application to Water Allocation under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 385-404, August.
    7. Václav Kozmík, 2015. "On variance reduction of mean-CVaR Monte Carlo estimators," Computational Management Science, Springer, vol. 12(2), pages 221-242, April.
    8. Gauvin, Charles & Delage, Erick & Gendreau, Michel, 2017. "Decision rule approximations for the risk averse reservoir management problem," European Journal of Operational Research, Elsevier, vol. 261(1), pages 317-336.
    9. Saif Benjaafar & Daniel Jiang & Xiang Li & Xiaobo Li, 2022. "Dynamic Inventory Repositioning in On-Demand Rental Networks," Management Science, INFORMS, vol. 68(11), pages 7861-7878, November.
    10. Riis, Morten & Andersen, Kim Allan, 2005. "Applying the minimax criterion in stochastic recourse programs," European Journal of Operational Research, Elsevier, vol. 165(3), pages 569-584, September.
    11. Moret, Fabio & Pinson, Pierre & Papakonstantinou, Athanasios, 2020. "Heterogeneous risk preferences in community-based electricity markets," European Journal of Operational Research, Elsevier, vol. 287(1), pages 36-48.
    12. Rudloff, Birgit & Street, Alexandre & Valladão, Davi M., 2014. "Time consistency and risk averse dynamic decision models: Definition, interpretation and practical consequences," European Journal of Operational Research, Elsevier, vol. 234(3), pages 743-750.
    13. Dan A. Iancu & Marek Petrik & Dharmashankar Subramanian, 2015. "Tight Approximations of Dynamic Risk Measures," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 655-682, March.
    14. Andre Luiz Diniz & Maria Elvira P. Maceira & Cesar Luis V. Vasconcellos & Debora Dias J. Penna, 2020. "A combined SDDP/Benders decomposition approach with a risk-averse surface concept for reservoir operation in long term power generation planning," Annals of Operations Research, Springer, vol. 292(2), pages 649-681, September.
    15. 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.
    16. Daniel R. Jiang & Warren B. Powell, 2018. "Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 554-579, May.
    17. W. Ackooij & X. Warin, 2020. "On conditional cuts for stochastic dual dynamic programming," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 173-199, June.
    18. Liu, Rui Peng & Shapiro, Alexander, 2020. "Risk neutral reformulation approach to risk averse stochastic programming," European Journal of Operational Research, Elsevier, vol. 286(1), pages 21-31.
    19. Michelle Bandarra & Vincent Guigues, 2021. "Single cut and multicut stochastic dual dynamic programming with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments," Computational Management Science, Springer, vol. 18(2), pages 125-148, June.
    20. Soares, Murilo Pereira & Street, Alexandre & Valladão, Davi Michel, 2017. "On the solution variability reduction of Stochastic Dual Dynamic Programming applied to energy planning," European Journal of Operational Research, Elsevier, vol. 258(2), pages 743-760.

    More about this item

    Keywords

    Multistage stochastic programming; Approximation; Markov dependence; SDDP;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    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:rvmgts:v:18:y:2024:i:7:d:10.1007_s11846-024-00733-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.