Stage-t scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
Open Access
- 1 December 2021
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 309 (1) , 1-35
Abstract
This paper presents a new and general approach, named “Stage-t Scenario Dominance,” to solve the risk-averse multi-stage stochastic mixed-integer programs (M-SMIPs). Given a monotonic objective function, our method derives a partial ordering of scenarios by pairwise comparing the realization of uncertain parameters at each time stage under each scenario. Specifically, we derive bounds and implications from the “Stage-t Scenario Dominance” by using the partial ordering of scenarios and solving a subset of individual scenario sub-problems up to stage t. Using these inferences, we generate new cutting planes to tackle the computational difficulty of risk-averse M-SMIPs. We also derive results on the minimum number of scenario-dominance relations generated. We demonstrate the use of this methodology on a stochastic version of the mean-conditional value-at-risk (CVaR) dynamic knapsack problem. Our computational experiments address those instances that have uncertainty, which correspond to the objective, left-hand side, and right-hand side parameters. Computational results show that our “scenario dominance"-based method can reduce the solution time for mean-risk, stochastic, multi-stage, and multi-dimensional knapsack problems with both integer and continuous variables, whose structure is similar to the mean-risk M-SMIPs, with varying risk characteristics by one-to-two orders of magnitude for varying numbers of random variables in each stage. Computational results also demonstrate that strong dominance cuts perform well for those instances with ten random variables in each stage, and ninety random variables in total. The proposed scenario dominance framework is general and can be applied to a wide range of risk-averse and risk-neutral M-SMIP problems.Keywords
Funding Information
- NSF (CMMI-1100765)
This publication has 57 references indexed in Scilit:
- Risk neutral and risk averse Stochastic Dual Dynamic Programming methodEuropean Journal of Operational Research, 2013
- A hierarchy of bounds for stochastic mixed-integer programsMathematical Programming, 2012
- Dynamic Programming Via Linear Programming2011
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problemsComputational Management Science, 2010
- Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer RecourseMathematical Programming, 2005
- Partitioning procedures for solving mixed-variables programming problemsComputational Management Science, 2005
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedraMathematical Programming, 2002
- Dual decomposition in stochastic integer programmingOperations Research Letters, 1999
- Lifting cover inequalities for the precedence-constrained knapsack problemDiscrete Applied Mathematics, 1997
- Polyhedral results for the precedence-constrained knapsack problemDiscrete Applied Mathematics, 1993