On conditional cuts for stochastic dual dynamic programming
Multistage stochastic programs arise in many applications from engineering whenever a set of inventories or stocks has to be valued. Such is the case in seasonal storage valuation of a set of cascaded reservoir chains in hydro management. A popular method is stochastic dual dynamic programming (SDDP...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Elsevier
2020
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/c48db89d44434951b699b68edbd0446e |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Multistage stochastic programs arise in many applications from engineering whenever a set of inventories or stocks has to be valued. Such is the case in seasonal storage valuation of a set of cascaded reservoir chains in hydro management. A popular method is stochastic dual dynamic programming (SDDP), especially when the dimensionality of the problem is large and dynamic programming is no longer an option. The usual assumption of SDDP is that uncertainty is stage-wise independent, which is highly restrictive from a practical viewpoint. When possible, the usual remedy is to increase the state-space to account for some degree of dependency. In applications, this may not be possible or it may increase the state-space by too much. In this paper, we present an alternative based on keeping a functional dependency in the SDDP—cuts related to the conditional expectations in the dynamic programming equations. Our method is based on popular methodology in mathematical finance, where it has progressively replaced scenario trees due to superior numerical performance. We demonstrate the interest of combining this way of handling dependency in uncertainty and SDDP on a set of numerical examples. Our method is readily available in the open-source software package StOpt. |
|---|