Bounding Multistage Stochastic Programs: A Scenario Tree Based Approach
Multistage mixed-integer stochastic programs are among the most challenging optimization problems combining stochastic programs and discrete optimization problems. Approximation techniques which provide lower and upper bounds to the optimal value are very useful in practice. In this paper we present a critic summary of the results in Maggioni et al., J Optim Theory Appl 163:200–229 (2014),  and in Maggioni et al., Comput Manag Sci 13:423–457 (2016),  where we consider bounds based on the assumption that a sufficiently large discretized scenario tree describing the problem uncertainty is given but is unsolvable. Bounds based on group subproblems, quality of the deterministic solution and rolling-horizon approximation will be then discussed and compared.
KeywordsMultistage stochastic programs Bounds Group subproblems
- 1.Crainic, T.G., Maggioni, F., Perboli, G., Rei, W.: Reduced Cost-Based Variable Fixing in Two-Stage Stochastic Programming (2017) Available via CIRRELT ReportsGoogle Scholar
- 3.Madansky, A.: Inequalities for stochastic linear programming problems. Manag. Sci. 6, 197–204 (1960)Google Scholar
- 8.Maggioni, F., Pflug, G.C.: Guaranteed Bounds for General Non-discrete Multistage Risk-Averse Stochastic Optimization Programs (2017) Submitted to SIOPTGoogle Scholar
- 11.Shapiro, A., Dencheva, D., Ruszczyński, A.: Lectures on Stochastic Programming: Modeling and Theory. MPS-SIAM Series on Optimization (2009)Google Scholar