Dynamic Programming Based Operation of Reservoirs

Dynamic Programming Based Operation of Reservoirs

Author: K. D. W. Nandalal

Publisher: Cambridge University Press

Published: 2007-05-10

Total Pages: 125

ISBN-13: 1139464957

DOWNLOAD EBOOK

Dynamic programming is a method of solving multi-stage problems in which decisions at one stage become the conditions governing the succeeding stages. It can be applied to the management of water reservoirs, allowing them to be operated more efficiently. This is one of the few books dedicated solely to dynamic programming techniques used in reservoir management. It presents the applicability of these techniques and their limits on the operational analysis of reservoir systems. The dynamic programming models presented in this book have been applied to reservoir systems all over the world, helping the reader to appreciate the applicability and limits of these models. The book also includes a model for the operation of a reservoir during an emergency situation. This volume will be a valuable reference to researchers in hydrology, water resources and engineering, as well as professionals in reservoir management.


Simplicial Approximation of the Value Function of Stochastic Dynamic Programming for Reservoir Systems

Simplicial Approximation of the Value Function of Stochastic Dynamic Programming for Reservoir Systems

Author: Luckny Zéphyr

Publisher:

Published: 2014

Total Pages: 18

ISBN-13: 9782895244028

DOWNLOAD EBOOK

We present a new approach for the approximation of the value function of Stochastic Dynamic Programming with a view to mitigate the curse of dimensionality. Under convexity assumptions, our method is based on a simplicial partition of the state space. Bounds on the value function provide guidance as to where refinement should be done, if at all. Thus, the method allows for a trade-off between solution time and accuracy. The proposed scheme is experimented in the particular context of hydroelectric production across multiple reservoirs..--Résumé de l'éditeur.