Upper and Lower Bounds for Large Scale Multistage Stochastic Optimization Problems: Decomposition Methods
2019
We consider a large scale multistage stochastic optimization problem involving multiple units. Each unit is a (small) control system. Static constraints couple units at each stage. To tackle such large scale problems, we propose two decomposition methods, whether handling the coupling constraints by prices or by resources. We introduce the sequence (one per stage) of global Bellman functions, depending on the collection of local states of all units. We show that every Bellman function is bounded above by a sum of local resource-decomposed value functions, and below by a sum of local price-decomposed value functions-each local decomposed function having for arguments the corresponding local unit state variables. We provide conditions under which these local value functions can be computed by Dynamic Programming. These conditions are established assuming a centralized information structure, that is, when the information available for each unit consists of the collection of noises affecting all the units. We finally study the case where each unit only observes its own local noise (decentralized information structure).
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
23
References
1
Citations
NaN
KQI