IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v12y2015i1p171-195.html
   My bibliography  Save this article

Multi-stage stochastic optimization: the distance between stochastic scenario processes

Author

Listed:
  • Anna Timonina

Abstract

Approximation techniques are challenging, important and very often irreplaceable solution methods for multi-stage stochastic optimization programs. Applications for scenario process approximation include financial and investment planning, inventory control, energy production and trading, electricity generation planning, pension fund management, supply chain management and similar fields. In multi-stage stochastic optimization problems the amount of stage-wise available information is crucial. While some authors deal with filtration distances, in this paper we consider the concepts of nested distributions and their distances which allows to keep the setup purely distributional but at the same time to introduce information and information constraints. Also we introduce the distance between stochastic process and a tree and we generalize the concept of nested distance for the case of infinite trees, i.e. for the case of two stochastic processes given by their continuous distributions. We are making a step towards to a new method for distribution quantization that is the most suitable for multi-stage stochastic optimization programs as it takes into account both the stochastic process and the stage-wise information. Copyright Springer-Verlag Berlin Heidelberg 2015

Suggested Citation

  • Anna Timonina, 2015. "Multi-stage stochastic optimization: the distance between stochastic scenario processes," Computational Management Science, Springer, vol. 12(1), pages 171-195, January.
    • Handle: RePEc:spr:comgts:v:12:y:2015:i:1:p:171-195
    DOI: 10.1007/s10287-013-0185-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10287-013-0185-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10287-013-0185-3?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. Yuri Ermoliev & Tatiana Ermolieva & Guenther Fischer & Marek Makowski, 2010. "Extreme events, discounting and stochastic optimization," Annals of Operations Research, Springer, vol. 177(1), pages 9-19, June.
    2. Georg Ch. Pflug & Alois Pichler, 2011. "Approximations for Probability Distributions and Stochastic Optimization Problems," International Series in Operations Research & Management Science, in: Marida Bertocchi & Giorgio Consigli & Michael A. H. Dempster (ed.), Stochastic Optimization Methods in Finance and Energy, edition 1, chapter 0, pages 343-387, Springer.
    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. Markéta Horejšová & Sebastiano Vitali & Miloš Kopa & Vittorio Moriggia, 2020. "Evaluation of scenario reduction algorithms with nested distance," Computational Management Science, Springer, vol. 17(2), pages 241-275, June.

    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. Bomze, Immanuel M. & Gabl, Markus & Maggioni, Francesca & Pflug, Georg Ch., 2022. "Two-stage stochastic standard quadratic optimization," European Journal of Operational Research, Elsevier, vol. 299(1), pages 21-34.
    2. Walter Gutjahr & Alois Pichler, 2016. "Stochastic multi-objective optimization: a survey on non-scalarizing methods," Annals of Operations Research, Springer, vol. 236(2), pages 475-499, January.
    3. Walter J. Gutjahr & Alois Pichler, 2016. "Stochastic multi-objective optimization: a survey on non-scalarizing methods," Annals of Operations Research, Springer, vol. 236(2), pages 475-499, January.
    4. Beltran-Royo, C., 2017. "Two-stage stochastic mixed-integer linear programming: The conditional scenario approach," Omega, Elsevier, vol. 70(C), pages 31-42.
    5. Pichler, Alois & Tomasgard, Asgeir, 2016. "Nonlinear stochastic programming–With a case study in continuous switching," European Journal of Operational Research, Elsevier, vol. 252(2), pages 487-501.
    6. Seljom, Pernille & Kvalbein, Lisa & Hellemo, Lars & Kaut, Michal & Ortiz, Miguel Muñoz, 2021. "Stochastic modelling of variable renewables in long-term energy models: Dataset, scenario generation & quality of results," Energy, Elsevier, vol. 236(C).
    7. Yannan Chen & Hailin Sun & Huifu Xu, 2021. "Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems," Computational Optimization and Applications, Springer, vol. 78(1), pages 205-238, January.
    8. Emilio L. Cano & Javier M. Moguerza & Tatiana Ermolieva & Yurii Yermoliev, 2017. "A strategic decision support system framework for energy-efficient technology investments," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(2), pages 249-270, July.
    9. Arno Berger & Chuang Xu, 2020. "Asymptotics of One-Dimensional Lévy Approximations," Journal of Theoretical Probability, Springer, vol. 33(2), pages 1164-1195, June.
    10. Arno Berger & Chuang Xu, 2019. "Best Finite Approximations of Benford’s Law," Journal of Theoretical Probability, Springer, vol. 32(3), pages 1525-1553, September.
    11. Ludovic Gaudard & Franco Romerio, 2015. "Natural hazard risk in the case of an emergency: the real options’ approach," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 75(1), pages 473-488, January.
    12. 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.
    13. Nilay Noyan & Gábor Rudolf & Miguel Lejeune, 2022. "Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 729-751, March.
    14. 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.
    15. Michal Kaut, 2021. "Scenario generation by selection from historical data," Computational Management Science, Springer, vol. 18(3), pages 411-429, July.
    16. Lars Hellemo & Paul I. Barton & Asgeir Tomasgard, 2018. "Decision-dependent probabilities in stochastic programs with recourse," Computational Management Science, Springer, vol. 15(3), pages 369-395, October.
    17. H. Heitsch & H. Leövey & W. Römisch, 2016. "Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?," Computational Optimization and Applications, Springer, vol. 65(3), pages 567-603, December.
    18. Wei Wang & Huifu Xu & Tiejun Ma, 2020. "Quantitative Statistical Robustness for Tail-Dependent Law Invariant Risk Measures," Papers 2006.15491, arXiv.org.
    19. Hailin Sun & Huifu Xu, 2016. "Convergence Analysis for Distributionally Robust Optimization and Equilibrium Problems," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 377-401, May.

    More about this item

    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:12:y:2015:i:1:p:171-195. 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.