Please help transcribe this video using our simple transcription tool. You need to be logged in to do so.


Storage problems are an important subclass of stochastic control problems. This paper presents a new method, approximate dynamic programming for storage, to solve storage problems with continuous, convex decision sets. Unlike other solution procedures, ADPS allows math programming to be used to make decisions each time period, even in the presence of large state variables. We test ADPS on the day ahead wind commitment problem with storage.

Questions and Answers

You need to be logged in to be able to post here.