On Finite Adaptability in Two-Stage Distributionally Robust Optimization

References

• Atkinson KE (2008) An Introduction to Numerical Analysis (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Azizi MJ, Vayanos P, Wilder B, Rice E, Tambe M (2018) Designing fair, efficient, and interpretable policies for prioritizing homeless youth for housing resources. Proc. Internat. Conference on the Integration of Constraint Programming, Artificial Intelligence, and Oper. Res. (Springer, Cham, Switzerland), 35–51.Google Scholar
• Bandi C, Han E, Nohadani O (2019) Sustainable inventory with robust periodic-affine policies and application to medical supply chains. Management Sci. 65(10):4636–4655.Link, Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Ben-Tal A, El Housni O, Goyal V (2020) A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization. Math. Programming 182(1):57–102.Crossref, Google Scholar
• Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.Crossref, Google Scholar
• Ben-Tal A, Den Hertog D, De Waegenaere A, Melenberg B, Rennen G (2013) Robust solutions of optimization problems affected by uncertain probabilities. Management Sci. 59(2):341–357.Link, Google Scholar
• Bertsimas D, Bidkhori H (2015) On the performance of affine policies for two-stage adaptive optimization: A geometric perspective. Math. Programming 153(2):577–594.Crossref, Google Scholar
• Bertsimas D, Caramanis C (2010) Finite adaptability in multistage linear optimization. IEEE Trans. Automated Control 55(12):2751–2766.Crossref, Google Scholar
• Bertsimas D, Dunning I (2016) Multistage robust mixed-integer optimization with adaptive partitions. Oper. Res. 64(4):980–998.Link, Google Scholar
• Bertsimas D, Georghiou A (2015) Design of near optimal decision rules in multistage adaptive mixed-integer optimization. Oper. Res. 63(3):610–627.Link, Google Scholar
• Bertsimas D, Goyal V (2012) On the power and limitations of affine policies in two-stage adaptive optimization. Math. Programming 134(2):491–531.Crossref, Google Scholar
• Bertsimas D, Brown DB, Caramanis C (2011a) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Crossref, Google Scholar
• Bertsimas D, Farias VF, Trichakis N (2013) Fairness, efficiency, and flexibility in organ allocation for kidney transplantation. Oper. Res. 61(1):73–87.Link, Google Scholar
• Bertsimas D, Goyal V, Lu BY (2015) A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization. Math. Programming 150(2):281–319.Crossref, Google Scholar
• Bertsimas D, Goyal V, Sun XA (2011b) A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization. Math. Oper. Res. 36(1):24–54.Link, Google Scholar
• Bertsimas D, Gupta V, Kallus N (2018a) Data-driven robust optimization. Math. Programming 167(2):235–292.Crossref, Google Scholar
• Bertsimas D, Iancu DA, Parrilo PA (2010) Optimality of affine policies in multistage robust optimization. Math. Oper. Res. 35(2):363–394.Link, Google Scholar
• Bertsimas D, Iancu DA, Parrilo PA (2011c) A hierarchy of near-optimal policies for multistage adaptive optimization. IEEE Trans. Automated Control 56(12):2809–2824.Crossref, Google Scholar
• Bertsimas D, Shtern S, Sturt B (2018b) A Data-Driven Approach for Multi-Stage Linear Optimization (Optimization Online).Google Scholar
• Bertsimas D, Sim M, Zhang M (2019) Adaptive distributionally robust optimization. Management Sci. 65(2):604–618.Link, Google Scholar
• Bezanson J, Edelman A, Karpinski S, Shah VB (2017) Julia: A fresh approach to numerical computing. SIAM Rev. 59(1):65–98.Crossref, Google Scholar
• Birge JR (1985) Decomposition and partitioning methods for multistage stochastic linear programs. Oper. Res. 33(5):989–1007.Link, Google Scholar
• Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer, Berlin).Crossref, Google Scholar
• Blanchet J, Kang Y, Murthy K (2019) Robust Wasserstein profile inference and applications to machine learning. J. Appl. Probability 56(3):830–857.Crossref, Google Scholar
• Chen Z, Powell WB (1999) Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse. J. Optim. Theory Appl. 102(3):497–524.Crossref, Google Scholar
• Chen Z, Sim M, Xiong P (2020) Robust stochastic optimization made easy with RSOME. Management Sci. 66(8):3329–3339.Link, Google Scholar
• Chen X, Sim M, Sun P, Zhang J (2008) A linear decision-based approximation approach to stochastic programming. Oper. Res. 56(2):344–357.Link, Google Scholar
• Ciocan DF, Mišić VV (2020) Interpretable optimal stopping. Management Sci. 68(3):1616–1638.Google Scholar
• Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.Link, Google Scholar
• El Housni O, Goyal V (2017) Beyond worst-case: A probabilistic analysis of affine policies in dynamic optimization. Adv. Neural Inform. Processing Systems 30:4759–4767.Google Scholar
• El Housni O, Goyal V (2018) Piecewise static policies for two-stage adjustable robust linear optimization. Math. Program. 169(2):649–665.Crossref, Google Scholar
• Gabrel V, Murat C, Thiele A (2014) Recent advances in robust optimization: An overview. Eur. J. Oper. Res. 235(3):471–483.Crossref, Google Scholar
• Gallego G, Ryan JK, Simchi-Levi D (2001) Minimax analysis for finite-horizon inventory models. IIE Trans. 33(10):861–874.Crossref, Google Scholar
• Gao R, Kleywegt AJ (2016) Distributionally robust stochastic optimization with Wasserstein distance. Preprint, submitted April 30, 2022 (v3), https://arxiv.org/abs/1604.02199.Google Scholar
• Gao R, Chen X, Kleywegt AJ (2017) Wasserstein distributional robustness and regularization in statistical learning. Preprint, submitted, December 17 https://arxiv.org/abs/1712.06050.Google Scholar
• Georghiou A, Tsoukalas A, Wiesemann W (2020) A primal–dual lifting scheme for two-stage robust optimization. Oper. Res. 68(2):572–590.Abstract, Google Scholar
• Georghiou A, Wiesemann W, Kuhn D (2015) Generalized decision rule approximations for stochastic programming via liftings. Math. Programming 152(1):301–338.Crossref, Google Scholar
• Ghosh S, Lam H (2019) Robust analysis in stochastic simulation: Computation and performance guarantees. Oper. Res. 67(1):232–249.Link, Google Scholar
• Goh J, Sim M (2010) Distributionally robust optimization and its tractable approximations. Oper. Res. 58(1):902–917.Link, Google Scholar
• Hadjiyiannis MJ, Goulart PJ, Kuhn D (2011) A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization. Proc. IEEE Conf. Decision Control (IEEE, New York), 7386–7391.Google Scholar
• Hanasusanto GA, Kuhn D, Wiesemann W (2015b) K-adaptability in two-stage robust binary programming. Oper. Res. 63(4):877–891.Link, Google Scholar
• Hanasusanto GA, Kuhn D, Wiesemann W (2016) K-adaptability in two-stage distributionally robust binary programming. Oper. Res. Lett. 44(1):6–11.Crossref, Google Scholar
• Hanasusanto GA, Kuhn D, Wallace SW, Zymler S (2015a) Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Math. Programming 152(1–2):1–32.Crossref, Google Scholar
• Iancu DA, Sharma M, Sviridenko M (2013) Supermodularity and affine policies in dynamic robust optimization. Oper. Res. 61(4):941–956.Link, Google Scholar
• Iyengar GN (2005) Robust dynamic programming. Math. Oper. Res. 30(2):257–280.Link, Google Scholar
• Jiang R, Guan Y (2018) Risk-averse two-stage stochastic program with distributional ambiguity. Oper. Res. 66(5):1390–1405.Link, Google Scholar
• Kuhn D, Wiesemann W, Georghiou A (2011) Primal and dual linear decision rules in stochastic and robust optimization. Math. Programming 130(1):177–209.Crossref, Google Scholar
• Love D, Bayraksan G (2015) Phi-divergence constrained ambiguous stochastic programs for data-driven optimization. Technical report, The Ohio State University, Columbus, OH.Google Scholar
• Mak HY, Rong Y, Zhang J (2014) Appointment scheduling with limited distributional information. Management Sci. 61(2):316–334.Link, Google Scholar
• Mohajerin Esfahani P, 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
• Nilim A, El Ghaoui L (2005) Robust control of Markov decision processes with uncertain transition matrices. Oper. Res. 53(5):780–798.Link, Google Scholar
• Nohadani O, Roy A (2017) Robust optimization with time-dependent uncertainty in radiation therapy. IISE Trans. Healthcare Systems Engrg. 7(2):81–92.Crossref, Google Scholar
• Nohadani O, Sharma K (2018) Optimization under decision-dependent uncertainty. SIAM J. Optim. 28(2):1773–1795.Crossref, Google Scholar
• Philpott A, Guan Z (2008) On the convergence of sampling-based methods for multi-stage stochastic linear programs. Oper. Res. Lett. 36:450–455.Crossref, Google Scholar
• Poss M (2013) Robust combinatorial optimization with variable budgeted uncertainty. 4OR 11(1):75–92.Crossref, Google Scholar
• Postek K, den Hertog D (2016) Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set. INFORMS J. Comput. 28(3):553–574.Link, Google Scholar
• Postek K, Ben-Tal A, Den Hertog D, Melenberg B (2018) Robust optimization with ambiguous stochastic constraints under mean and dispersion information. Oper. Res. 66(3):814–833.Link, Google Scholar
• Postek K, Romeijnders W, Den Hertog D, van der Vlerk MH (2019) An approximation framework for two-stage ambiguous stochastic integer programs under mean-mad information. Eur. J. Oper. Res. 274(2):432–444.Crossref, Google Scholar
• Powell WB, Jaillet P, Odoni A (1995) Stochastic and dynamic networks and routing. Handbook Oper. Res. Management Sci. 8:141–295.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–2):393–430.Crossref, Google Scholar
• Rockafellar RT, Wets R (1991) Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16(1):119–147.Link, Google Scholar
• Santoso T, Ahmed S, Goetschalckx M, Shapiro A (2005) A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167(1):96–115.Crossref, Google Scholar
• Scarf HE, Arrow KS, Karlin S (1958) A min-max solution of an inventory problem. Arrow KS, Karlin S, Scarf HE, eds. Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA), 201–209.Google Scholar
• Sen S, Yu L, Genc T (2006) A stochastic programming approach to power portfolio optimization. Oper. Res. 54(1):55–72.Link, Google Scholar
• Subramanyam A, Gounaris CE, Wiesemann W (2020) K-adaptability in two-stage mixed-integer robust optimization. Math. Programming Comput. (12):193–224.Crossref, Google Scholar
• Wang X, Zhang J (2015) Process flexibility: A distribution-free bound on the performance of k-chain. Oper. Res. 63(3):555–571.Link, Google Scholar
• Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar