Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
SG-Portfolio Test Problems for Stochastic Multistage Linear Programming
The solvability of dynamic decision problems suffer from the curse of dimensionality which limits the planning horizon one can afford for map** the real problem into a numeric solvable dynamic optimization m...