-

 

 

 




Optimization Online





 

Stationary Multistage Programs

Alexander Shapiro (ashapiro***at***isye.gatech.edu)
Lingquan Ding (lding47***at***gatech.edu)

Abstract: In some applications the considered multistage stochastic programs have a periodical behavior. We show that in such cases it is possible to drastically reduce the number of stages by introducing a periodical analog of the so-called Bellman equations, used in Markov Decision Processes and Stochastic Optimal Control. Furthermore, we describe a variant of the Stochastic Dual Dynamic Programming algorithm, applied to the constructed periodical Bellman equations, and provide numerical experiments for the Brazilian interconnected power system problem.

Keywords: multistage programs, decision rules, dynamic programming, Bellman equations, SDDP algorithm, fixed point theorem

Category 1: Stochastic Programming

Citation: Technical report

Download: [PDF]

Entry Submitted: 09/15/2019
Entry Accepted: 09/15/2019
Entry Last Modified: 10/17/2019

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society