Optimization-Based Scenario Reduction for Data-Driven Two-Stage Stochastic Optimization

References

• Arpón S, Homem-de Mello T, Pagnoncelli B (2018) Scenario reduction for stochastic programs with conditional value-at-risk. Math. Programming 170(1):327–356.Crossref, Google Scholar
• Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit V (2004) Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3):544–562.Crossref, Google Scholar
• Bailey TG, Jensen PA, Morton DP (1999) Response surface analysis of two-stage stochastic linear programming with recourse. Naval Res. Logist. 46(7):753–776.Crossref, Google Scholar
• Bayraksan G, Morton DP (2011) A sequential sampling procedure for stochastic programming. Oper. Res. 59(4):898–913.Link, Google Scholar
• Bertsimas D, Johnson M, Kallus N (2015) The power of optimization over randomization in designing experiments involving small samples. Oper. Res. 63(4):868–876.Link, Google Scholar
• Bertsimas D, Korolko N, Weinstein AM (2019) Covariate-adaptive optimization in online clinical trials. Oper. Res. 67(4):1150–1161.Abstract, Google Scholar
• Bezanson J, Karpinski S, Shah VB, Edelman A (2012) Julia: A fast dynamic language for technical computing. Preprint, submitted September 24, https://arxiv.org/abs/1209.5145.Google Scholar
• Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer Science & Business Media, New York).Crossref, Google Scholar
• Dantzig GB (1963) Linear Programming and Extensions (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Dunning I, Huchette J, Lubin M (2017) JuMP: A modeling language for mathematical optimization. SIAM Rev. 59(2):295–320.Crossref, Google Scholar
• Dupačová J, Gröwe-Kuska N, Römisch W (2003) Scenario reduction in stochastic programming. Math. Programming 95(3):493–511.Crossref, Google Scholar
• Elmachtoub AN, Grigas P (2022) Smart “predict, then optimize.” Management Sci. 68(1):9–26.Google Scholar
• Esfahani PM, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Programming 171(1–2):115–166.Crossref, Google Scholar
• Fairbrother J, Turner A, Wallace S (2022) Problem-driven scenario generation: An analytical approach for stochastic programs with tail risk measure. Math. Programming 191(1):141–182.Google Scholar
• Gao R, Kleywegt AJ (2016) Distributionally robust stochastic optimization with Wasserstein distance. Preprint, submitted July 16, https://arxiv.org/abs/1604.02199.Google Scholar
• Hanasusanto GA, Kuhn D (2018) Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls. Oper. Res. 66(3):849–869.Link, Google Scholar
• Heitsch H, Römisch W (2003) Scenario reduction algorithms in stochastic programming. Comput. Optim. Appl. 24(2–3):187–206.Crossref, Google Scholar
• Henrion R, Römisch W (2022) Problem-based optimal scenario generation and reduction in stochastic programming. Math. Programming. 191(1):183–205.Crossref, Google Scholar
• Hewitt M, Ortmann J, Rei W (2021) Decision-based scenario clustering for decision-making under uncertainty. Ann. Oper. Res., ePub ahead of print January 2, https://doi.org/10.1007/s10479-020-03843-x.Google Scholar
• Higle JL, Sen S (1991) Stochastic decomposition: An algorithm for two-stage linear programs with recourse. Math. Oper. Res. 16(3):650–669.Link, Google Scholar
• Homem-de Mello T, Bayraksan G (2014) Monte Carlo sampling-based methods for stochastic optimization. Survey Oper. Res. Management Sci. 19(1):56–85.Crossref, Google Scholar
• Høyland K, Wallace SW (2001) Generating scenario trees for multistage decision problems. Manage. Sci. 47(2):295–307.Link, Google Scholar
• Høyland K, Kaut M, Wallace SW (2003) A heuristic for moment-matching scenario generation. Comput. Optim. Appl. 24(2–3):169–185.Crossref, Google Scholar
• Infanger G (1992) Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs. Ann. Oper. Res. 39(1):69–95.Crossref, Google Scholar
• Keutchayan J, Ortmann J, Rei W (2021) Problem-driven scenario clustering in stochastic optimization. Preprint, submitted June 22, https://arxiv.org/abs/2106.11717.Google Scholar
• Kim S, Pasupathy R, Henderson SG (2015) A guide to sample average approximation. Handbook of Simulation Optimization (Springer, Berlin), 207–243.Crossref, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Linderoth J, Shapiro A, Wright S (2006) The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142(1):215–241.Crossref, Google Scholar
• Lloyd S (1982) Least squares quantization in pcm. IEEE Trans. Inform. Theory 28(2):129–137.Crossref, Google Scholar
• Morales JM, Pineda S, Conejo AJ, Carrion M (2009) Scenario reduction for futures market trading in electricity markets. IEEE Trans. Power Systems 24(2):878–888.Crossref, Google Scholar
• Nesterov Y (2003) Introductory Lectures on Convex Optimization: A Basic Course, vol. 87 (Springer Science & Business Media, New York).Google Scholar
• Papavasiliou A, Oren SS (2013) Multiarea stochastic unit commitment for high wind penetration in a transmission constrained network. Oper. Res. 61(3):578–592.Link, Google Scholar
• Pflug GC, Pichler A (2011) Approximations for probability distributions and stochastic optimization problems. Stochastic Optimization Methods in Finance and Energy (Springer, Berlin), 343–387.Crossref, Google Scholar
• Pflug GC, Pichler A (2014) Multistage Stochastic Optimization (Springer, Berlin).Crossref, Google Scholar
• Pineda S, Conejo A (2010) Scenario reduction for risk-averse electricity trading. IET Generation Transmission Distribution 4(6):694–705.Crossref, Google Scholar
• Rachev ST (1991) Probability Metrics and the Stability of Stochastic Models, vol. 269 (John Wiley & Son, Hoboken, NJ).Google Scholar
• Rahimian H, Bayraksan G, Homem-de Mello T (2019) Identifying effective scenarios in distributionally robust stochastic programs with total variation distance. Math. Programming 173(1):393–430.Crossref, Google Scholar
• Römisch W, Wets RB (2007) Stability of ε-approximate solutions to convex stochastic programs. SIAM J. Optim. 18(3):961–979.Crossref, Google Scholar
• Rujeerapaiboon N, Schindler K, Kuhn D, Wiesemann W (2022) Scenario reduction revisited: Fundamental limits and guarantees. Math. Programming 191(1):207–242.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).Crossref, Google Scholar
• Wallace SW, Ziemba WT (2005) Applications of Stochastic Programming (SIAM, Philadelphia).Crossref, Google Scholar
• Xiao L, Zhang T (2014) A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24(4):2057–2075.Crossref, Google Scholar