Exact and Approximate Schemes for Robust Optimization Problems with Decision-Dependent Information Discovery

References

• Adulyasak Y, Cordeau JF, Jans R (2015) Benders decomposition for production routing under demand uncertainty. Oper. Res. 63(4):851–867.Link, Google Scholar
• Ayoub J, Poss M (2016) Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Comput. Management Sci. 13(2):219–239.Crossref, Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (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
• Bertsimas D, Caramanis C (2010) Finite adaptability in multistage linear optimization. IEEE Trans. Automatic 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, Georghiou A (2018) Binary decision rules for multistage adaptive mixed-integer optimization. Math. Programming 167(2):395–433.Crossref, Google Scholar
• Bertsimas D, O’Hair A (2013) Learning preferences under noise and loss aversion: An optimization approach. Oper. Res. 61(5):1190–1199.Link, Google Scholar
• Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Crossref, Google Scholar
• Bertsimas D, Dunning I, Lubin M (2016) Reformulation vs. cutting-planes for robust optimization. Comput. Management Sci. 13(2):195–217.Crossref, Google Scholar
• Bertsimas D, Sim M, Zhang M (2019) Adaptive distributionally robust optimization. Management Sci. 65(2):604–618.Link, Google Scholar
• Boland N, Dumitrescu I, Froyland G, Kalinowski T (2016) Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming. Math. Programming 157(1):69–93.Crossref, Google Scholar
• Buchheim C, Kurtz J (2017) Min–max–min robust combinatorial optimization. Math. Programming 163(1–2):1–23.Crossref, Google Scholar
• Campbell AM, Gendreau M, Thomas BW (2011) The orienteering problem with stochastic travel and service times. Ann. Oper. Res. 186(1):61–81.Crossref, Google Scholar
• Carøe CC, Tind J (1998) L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Programming 83(1):451–464.Crossref, Google Scholar
• Chassein A, Goerigk M, Kurtz J, Poss M (2019) Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. Eur. J. Oper. Res. 279(2):308–319.Crossref, Google Scholar
• Chen X, Zhang Y (2009) Uncertain linear programs: Extended affinely adjustable robust counterparts. Oper. Res. 57(6):1469–1482.Link, Google Scholar
• Colvin M, Maravelias CT (2008) A stochastic programming approach for clinical trial planning in new drug development. Comput. Chemical Engrg. 32(11):2626–2642.Crossref, Google Scholar
• Colvin M, Maravelias CT (2010) Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming. Eur. J. Oper. Res. 203(1):205–215.Crossref, Google Scholar
• Delage E, Iancu D (2015) Robust multistage decision making. Aleman DM, Thiele AC, eds. The Operations Research Revolution. INFORMS Tutorials in Operations Research (INFORMS, Catonsville, MD), 20–46.Link, Google Scholar
• Evers L, Dollevoet T, Barros AI, Monsuur H (2014a) Robust UAV mission planning. Ann. Oper. Res. 222(1):293–315.Crossref, Google Scholar
• Evers L, Glorie K, Van Der Ster S, Barros AI, Monsuur H (2014b) A two-stage approach to the orienteering problem with stochastic weights. Comput. Oper. Res. 43(1):248–260.Crossref, Google Scholar
• Fischetti M, Gonzalez JJS, Toth P (1998) Solving the orienteering problem through branch-and-cut. INFORMS J. Comput. 10(2):133–148.Link, Google Scholar
• Fischetti M, Ljubić I, Sinnl M (2017) Redesigning Benders decomposition for large-scale facility location. Management Sci. 63(7):2146–2162.Link, Google Scholar
• Fragnière E, Gondzio J, Yang X (2010) Operations risk management by optimally planning the qualified workforce capacity. Eur. J. Oper. Res. 202(2):518–527.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
• Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G (2014) A survey on algorithmic approaches for solving tourist trip design problems. J. Heuristics 20(3):291–328.Crossref, 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
• Goel V, Grossmann IE (2004) A stochastic programming approach to planning of offshore gas field developments under uncertainty in reserves. Comput. Chemical Engrg. 28(8):1409–1429.Crossref, Google Scholar
• Goel V, Grossmann IE (2006) A class of stochastic programs with decision dependent uncertainty. Math. Programming 108(2–3):355–394.Crossref, Google Scholar
• Gunawan A, Lau HC, Vansteenwegen P (2016) Orienteering problem: A survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2):315–332.Crossref, Google Scholar
• Gupta V, Grossmann IE (2011) Solution strategies for multistage stochastic programming with endogenous uncertainties. Comput. Chem. Engrg. 35(11):2235–2247.Crossref, Google Scholar
• Hanasusanto GA, Kuhn D, Wiesemann W (2015) K-adaptability in two-stage robust binary programming. Oper. Res. 63(4):877–891.Link, Google Scholar
• Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math. Programming 96(1):33–60.Crossref, Google Scholar
• Jonsbråten TW, Wets RJ, Woodruff DL (1998) A class of stochastic programs with decision dependent random elements. Ann. Oper. Res. 82:83–106.Crossref, Google Scholar
• Joosten M (2019) Tracking medical crates in the Alrijne hospital through sensors. Master’s thesis, School of Business and Economics, Vrije Universiteit, Amsterdam.Google Scholar
• Laporte G, Louveaux FV (1993) The integer l-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.Crossref, Google Scholar
• Macias JE, Goldbeck N, Hsu PY, Angeloudis P, Ochieng W (2020) Endogenous stochastic optimisation for relief distribution assisted with unmanned aerial vehicles. OR Spectrum 42(4):1089–1125.Crossref, Google Scholar
• McCormick GP (1983) Nonlinear Programming; Theory, Algorithms, and Applications (Wiley, New York).Google Scholar
• Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J. ACM 7(4):326–329.Crossref, Google Scholar
• Omer J, Poss M, Rougier M (2024) Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty. Open J. Math. Optim. 5:1–25.Google Scholar
• Paradiso R, Georghiou A, Dabia S, Tönissen D (2024) Exact and approximate schemes for robust optimization problems with decision-dependent information discovery. http://dx.doi.org/10.1287/ijoc.2023.0290.cd, https://github.com/INFORMSJoC/2023.0290.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
• Shapiro A (2017) Interchangeability principle and dynamic equations in risk averse stochastic programming. Oper. Res. Lett. 45(4):377–381.Crossref, Google Scholar
• Sherali HD, Alameddine A (1992) A new reformulation-linearization technique for bilinear programming problems. J. Global Optim. 2(4):379–410.Crossref, Google Scholar
• Solak S, Clarke JPB, Johnson EL, Barnes ER (2010) Optimization of R&D project portfolios under endogenous uncertainty. Eur. J. Oper. Res. 207(1):420–433.Crossref, Google Scholar
• Subramanyam A (2022) A Lagrangian dual method for two-stage robust optimization with binary uncertainties. Optim. Engrg. 23(4):1831–1871.Crossref, Google Scholar
• Subramanyam A, Gounaris CE, Wiesemann W (2019) K-adaptability in two-stage mixed-integer robust optimization. Math. Programming Comput. 12(2):193–224.Crossref, Google Scholar
• Tsiligirides T (1984) Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9):797–809.Crossref, Google Scholar
• Vansteenwegen P, Van Oudheusden D (2007) The mobile tourist guide: An OR opportunity. OR Insight 20(3):21–27.Crossref, Google Scholar
• Vansteenwegen P, Souffriau W, Van Oudheusden D (2011) The orienteering problem: A survey. Eur. J. Oper. Res. 209(1):1–10.Crossref, Google Scholar
• Vayanos P, Georghiou A, Yu H (2020a) Robust optimization with decision-dependent information discovery. Preprint, submitted April 18, https://arxiv.org/abs/2004.08490.Google Scholar
• Vayanos P, Kuhn D, Rustem B (2011) Decision rules for information discovery in multi-stage stochastic programming. 2011 50th IEEE Conf. Decision Control Eur. Control Conf. (Orlando, FL), 7368–7373.Google Scholar
• Vayanos P, McElfresh D, Ye Y, Dickerson J, Rice E (2020b) Active preference elicitation via adjustable robust optimization. Preprint, submitted March 4, https://arxiv.org/abs/2003.01899v1.Google Scholar
• Veen AL (2020) Tracking medical crates in the Alrijne hospital through sensors: Initial data analysis of the sensory data of the Alrijne hospital. Bachelor’s thesis, School of Business and Economics, Vrije Universiteit Amsterdam, Amsterdam.Google Scholar
• Verbeeck C, Vansteenwegen P, Aghezzaf EH (2016) Solving the stochastic time-dependent orienteering problem with time windows. Eur. J. Oper. Res. 255(3):699–718.Crossref, 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
• Zou J, Ahmed S, Sun XA (2019) Stochastic dual dynamic integer programming. Math. Programming 175(1):461–502.Crossref, Google Scholar