IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v348y2025i2d10.1007_s10479-022-04977-w.html
   My bibliography  Save this article

Incorporating convex risk measures into multistage stochastic programming algorithms

Author

Listed:
  • Oscar Dowson

    (Northwestern University)

  • David P. Morton

    (Northwestern University)

  • Bernardo K. Pagnoncelli

    (SKEMA Business School, Université Côte d’Azur)

Abstract

Over the last two decades, coherent risk measures have been well studied as a principled, axiomatic way to characterize the risk of a random variable. Because of this axiomatic approach, coherent risk measures have a number of attractive features for computation, and they have been integrated into a variety of stochastic programming algorithms, including stochastic dual dynamic programming (SDDP), a common class of data-driven solution methods for multistage stochastic programs. Coherent risk measures and SDDP are tools used to manage risk while solving data-driven problems. Perhaps the most prominent example involves informing operations and deriving electricity prices in power systems with significant hydro-electric power, including the Brazilian interconnected power system. We focus on incorporating the more general class of convex risk measures into an SDDP algorithm, exemplifying our approach with the entropic risk measure. It is well-known that coherent risk measures lead to an inconsistency if agents care about their state at the end of the time horizon, but control risk in a stage-wise fashion. The entropic risk measure does not have this shortcoming. We illustrate the advantages of the entropic risk measure with two small examples from transportation and finance, and test the numerical viability of our adaptation of the SDDP decomposition scheme in a large-scale hydro-thermal scheduling problem using data from the Brazilian system.

Suggested Citation

  • Oscar Dowson & David P. Morton & Bernardo K. Pagnoncelli, 2025. "Incorporating convex risk measures into multistage stochastic programming algorithms," Annals of Operations Research, Springer, vol. 348(2), pages 807-831, May.
  • Handle: RePEc:spr:annopr:v:348:y:2025:i:2:d:10.1007_s10479-022-04977-w
    DOI: 10.1007/s10479-022-04977-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-04977-w
    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/s10479-022-04977-w?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.

    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:annopr:v:348:y:2025:i:2:d:10.1007_s10479-022-04977-w. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.