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

Decomposition methods for monotone two-time-scale stochastic optimization problems

Author

Listed:
  • Tristan Rigaut

    (Schneider Electric)

  • Pierre Carpentier

    (ENSTA Paris)

  • Jean-Philippe Chancelier

    (École des Ponts ParisTech)

  • Michel Lara

    (École des Ponts ParisTech)

Abstract

It is common that strategic investment decisions are made at a slow time-scale, whereas operational decisions are made at a fast time-scale. Hence, the total number of decision stages may be huge. In this paper, we consider multistage stochastic optimization problems with two time-scales, and we propose a time block decomposition scheme to address them numerically. More precisely, (i) we write recursive Bellman-like equations at the slow time-scale and (ii), under a suitable monotonicity assumption, we propose computable upper and lower bounds—relying respectively on primal and dual decomposition—for the corresponding slow time-scale Bellman functions. With these functions, we are able to design policies. We assess the methods tractability and validate their efficiency by solving a battery management problem where the fast time-scale operational decisions have an impact on the storage current capacity, hence on the strategic decisions to renew the battery at the slow time-scale.

Suggested Citation

  • Tristan Rigaut & Pierre Carpentier & Jean-Philippe Chancelier & Michel Lara, 2024. "Decomposition methods for monotone two-time-scale stochastic optimization problems," Computational Management Science, Springer, vol. 21(1), pages 1-37, June.
    • Handle: RePEc:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-024-00510-5
    DOI: 10.1007/s10287-024-00510-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-024-00510-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-024-00510-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.

    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:21:y:2024:i:1:d:10.1007_s10287-024-00510-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.

    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.