Supermodularity in Two-Stage Distributionally Robust Optimization

References

• Agrawal S, Ding Y, Saberi A, Ye Y (2010) Correlation robust stochastic optimization. Charikar M, ed. Proc. 21st Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1087–1096.Google Scholar
• Ardestani-Jaafari A, Delage E (2016) Robust optimization of sums of piecewise linear functions with application to inventory problems. Oper. Res. 64(2):474–494.Link, Google Scholar
• Bansal M, Huang K-L, Mehrotra S (2018) Decomposition algorithms for two-stage distributionally robust mixed binary programs. SIAM J. Optim. 28(3):2360–2383.Crossref, Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization, vol. 28 (Princeton University Press, Princeton, NJ).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, Hochman E (1972) More bounds on the expectation of a convex function of a random variable. J. Appl. Probab. 9(4):803–812.Crossref, Google Scholar
• Bertsimas D, de Ruiter FJCT (2016) Duality in two-stage adaptive linear optimization: Faster computation and stronger bounds. INFORMS J. Comput. 28(3):500–511.Link, Google Scholar
• Bertsimas D, Doan XV, Natarajan K, Teo C-P (2010b) Models for minimax stochastic linear optimization problems with risk aversion. Math. Oper. Res. 35(3):580–602.Link, Google Scholar
• Bertsimas D, Goyal V (2010) On the power of robust solutions in two-stage stochastic and adaptive optimization problems. Math. Oper. Res. 35(2):284–305.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, Iancu DA, Parrilo PA (2010a) Optimality of affine policies in multistage robust optimization. Math. Oper. Res. 35(2):363–394.Link, Google Scholar
• Bertsimas D, Iancu DA, Parrilo PA (2011) A hierarchy of near-optimal policies for multistage adaptive optimization. IEEE Trans. Automatic Control 56(12):2809–2824.Crossref, Google Scholar
• Bertsimas D, Shtern S (2018) A scalable algorithm for two-stage adaptive linear optimization. Preprint, submitted July 8, https://arxiv.org/abs/1807.02812.Google Scholar
• Bertsimas D, Sim M, Zhang M (2019) Adaptive distributionally robust optimization. Management Sci. 65(2):604–618.Link, Google Scholar
• Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer Science & Business Media, New York).Crossref, Google Scholar
• Chen L, Ma W, Natarajan K, Simchi-Levi D, Yan Z (2022) Distributionally robust linear and discrete optimization with marginals. Oper. Res. 70(3):1822–1834.Link, Google Scholar
• Chen X (2017) L♮-convexity and its applications in operations. Frontiers Engrg. Management 4(3):283–294.Crossref, Google Scholar
• Chen X, Hu P, He S (2013) Preservation of supermodularity in parametric optimization problems with nonlattice structures. Oper. Res. 61(5):1166–1173.Link, Google Scholar
• Chen X, Long DZ, Qi J (2021) Preservation of supermodularity in parametric optimization: Necessary and sufficient conditions on constraint structures. Oper. Res. 69(1):1–12.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
• Chen Z, Sim M, Xiong P (2020) Robust stochastic optimization made easy with RSOME. Management Sci. 66(8):3329–3339.Link, Google Scholar
• Conejo AJ, Hall NG, Long DZ, Zhang R (2021) Robust capacity planning for project management. INFORMS J. Comput. 33(4):1533–1550.Abstract, 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 (2021) On the optimality of affine policies for budgeted uncertainty sets. Math. Oper. Res. 46(2):674–711.Link, Google Scholar
• Feige U, Jain K, Mahdian M, Mirrokni V (2007) Robust combinatorial optimization with exponential scenarios. Fischetti M, Williamson DP, eds. Internat. Conf. Integer Programming Combin. Optim. (Springer, Berlin), 439–453.Google Scholar
• Georghiou A, Tsoukalas A, Wiesemann W (2021) On the optimality of affine decision rules in robust and distributionally robust optimization. Working paper, University of Cyprus, Nicosia, Cyprus.Google Scholar
• Ghosal S, Ho CP, Wiesemann W (2021) A unifying framework for the capacitated vehicle routing problem under risk and ambiguity. Working paper, Imperial College London, London.Google Scholar
• Goh J, Sim M (2010) Distributionally robust optimization and its tractable approximations. Oper. Res. 58(4, pt. 1):902–917.Link, Google Scholar
• Gupta A, Nagarajan V, Ravi R (2014) Thresholded covering algorithms for robust and max–min optimization. Math. Programming 146(1):583–615.Crossref, Google Scholar
• Gupta D, Denton B (2008) Appointment scheduling in healthcare: Challenges and opportunities. IIE Trans. 40(9):800–819.Crossref, Google Scholar
• Hadley G, Whitin TM (1963) Analysis of Inventory Systems (Literary Licensing LLC, Whitefish, MT).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
• Hanasusanto GA, Kuhn D, Wallace SW, Zymler S (2015) 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
• Jiang R, Ryu M, Xu G (2019) Data-driven distributionally robust appointment scheduling over Wasserstein balls. Preprint, submitted July 7, https://arxiv.org/abs/1907.03219.Google Scholar
• Jiang R, Shen S, Zhang Y (2017) Integer programming approaches for appointment scheduling with random no-shows and service durations. Oper. Res. 65(6):1638–1656.Link, Google Scholar
• Kong Q, Lee C-Y, Teo C-P, Zheng Z (2013) Scheduling arrivals to a stochastic service delivery system using copositive cones. Oper. Res. 61(3):711–726.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
• Lu M, Ran L, Shen Z-JM (2015) Reliable facility location design under uncertain correlated disruptions. Manufacturing Service Oper. Management 17(4):445–455.Link, Google Scholar
• Lu Y, Song J-S (2005) Order-based cost optimization in assemble-to-order systems. Oper. Res. 53(1):151–169.Link, Google Scholar
• Mak H-Y, Rong Y, Zhang J (2014) Appointment scheduling with limited distributional information. Management Sci. 61(2):316–334.Link, Google Scholar
• Nadar E, Akan M, Scheller-Wolf A (2014) Optimal structural results for assemble-to-order generalized m-systems. Oper. Res. 62(3):571–579.Link, Google Scholar
• Natarajan K, Sim M, Uichanco J (2017) Asymmetry and ambiguity in newsvendor models. Management Sci. 64(7):3146–3167.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
• Qi J (2017) Mitigating delays and unfairness in appointment systems. Management Sci. 63(2):566–583.Link, Google Scholar
• Rachev ST, Rüschendorf L. (1998) Mass Transportation Problems, Volume I: Theory (Springer Science & Business Media, New York).Google Scholar
• Saif A, Delage E (2021) Data-driven distributionally robust capacitated facility location problem. Eur. J. Oper. Res. 291(3):995–1007.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).Crossref, Google Scholar
• Song J-S, Zipkin P (2003) Supply chain operations: Assemble-to-order systems. Handbook Oper. Res. Management Sci. 11:561–596.Google Scholar
• Topkis DM (1998) Supermodularity and Complementarity (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• van Eekelen W, den Hertog D, Johan SH van Leeuwaarden JSH (2022) MAD dispersion measure makes extremal queue analysis simple. INFORMS J. Comput. 34(3):1681–1692.Link, Google Scholar
• Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar
• Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5):457–461.Crossref, Google Scholar
• Zipkin P (2016) Some specially structured assemble-to-order systems. Oper. Res. Lett. 44(1):136–142.Crossref, Google Scholar