Distributionally Risk-Receptive and Robust Multistage Stochastic Integer Programs and Two-player Interdiction Games with(out) Decision-Dependent Uncertainty

In this paper, we study distributionally risk-receptive and distributionally robust (or risk-averse) multistage stochastic mixed-integer programs (denoted by DRR- and DRA-MSIPs). These frameworks are useful for optimization problems under uncertainty where the focus is on analyzing outcomes based on multiple decision-makers’ differing perspectives, such as interdiction problems that are attacker-defender games having non-cooperative players. We … Read more

Guaranteed Bounds for General Non-discrete Multistage Risk-Averse Stochastic Optimization Programs

In general, multistage stochastic optimization problems are formulated on the basis of continuous distributions describing the uncertainty. Such ”infinite” problems are practically impossible to solve as they are formulated and finite tree approximations of the underlying stochastic processes are used as proxies. In this paper, we demonstrate how one can find guaranteed bounds, i.e. finite … Read more

SDDP for multistage stochastic programs: Preprocessing via scenario reduction

Even with recent enhancements, computation times for large-scale multistage problems with risk-averse objective functions can be very long. Therefore, preprocessing via scenario reduction could be considered as a way to significantly improve the overall performance. Stage-wise backward reduction of single scenarios applied to a fixed branching structure of the tree is a promising tool for … Read more