Adjustable Robust Optimization with Discrete Uncertainty

References

• Arslan AN, Detienne B (2022) Decomposition-based approaches for a class of two-stage robust binary optimization problems. INFORMS J. Comput. 34(2):857–871.Link, Google Scholar
• Ben-Tal A, Nemirovski A (1999) Robust solutions to uncertain linear programs. Oper. Res. Lett. 25(1):1–13.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 (2017) Binary decision rules for multistage adaptive mixed-integer optimization. Math. Programming 167(2):395–433.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Birge J, Louveaux F (2011) Introduction to Stochastic Programming, Springer Series in Operations Research and Financial Engineering (Springer, New York).Crossref, Google Scholar
• Buchheim C, Kurtz J (2018) Robust combinatorial optimization under convex and discrete cost uncertainty. EURO J. Comput. Optim. 6(3):211–238.Crossref, Google Scholar
• Cornuéjols G, Sridharan R, Thizy JM (1991) A comparison of heuristics and relaxations for the capacitated plant location problem. Eur. J. Oper. Res. 50(3):280–297.Crossref, Google Scholar
• Detienne B, Lefebvre H, Malaguti E, Monaci M (2024) Adjustable robust optimization with objective uncertainty. Eur. J. Oper. Res. 312(1):373–384.Crossref, Google Scholar
• Feizollahi MJ, Ahmed S, Sun A (2016) Exact augmented Lagrangian duality for mixed integer linear programming. Math. Programming 161(1–2):365–387.Crossref, Google Scholar
• Fischetti M, Ljubić I, Monaci M, Sinnl M (2019) Interdiction games and monotonicity, with application to knapsack problems. INFORMS J. Comput. 31(2):390–410.Link, Google Scholar
• Gorissen BL, Yanikoğlu İ, den Hertog D (2015) A practical guide to robust optimization. Omega 53:124–137.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
• Kämmerling N, Kurtz J (2020) Oracle-based algorithms for binary two-stage robust optimization. Comput. Optim. Appl. 77(2):539–569.Crossref, Google Scholar
• Malaguti E, Monaci M, Pruente J (2022) K-adaptability in stochastic optimization. Math. Programming 196:567–595.Crossref, Google Scholar
• Pisinger D (2005) Where are the hard knapsack problems? Comput. Oper. Res. 32(9):2271–2284.Crossref, Google Scholar
• Postek K, den Hertog D (2016) Multi-stage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set. INFORMS J. Comput. 28(3):553–574.Link, Google Scholar
• Prékopa A (2013) Stochastic Programming, Mathematics and Its Applications (Springer, Dordrecht, Netherlands).Google Scholar
• Romeijnders W, Postek K (2021) Piecewise constant decision rules via branch-and-bound based scenario detection for integer adjustable robust optimization. INFORMS J. Comput. 33(1):390–400.Link, Google Scholar
• Shapiro A, Dentcheva D, Ruszczynski A (2021) Lectures on Stochastic Programming: Modeling and Theory, MOS-SIAM Series on Optimization (SIAM, Philadelphia).Crossref, Google Scholar
• Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5):1154–1157.Link, 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
• Zeng B, Zhao L (2012) Solving two-stage robust optimization problems using a column and constraint generation method. Oper. Res. Lett. 41(5):457–461.Crossref, Google Scholar
• Zhao L, Zeng B (2013) An exact algorithm for two-stage robust optimization with mixed integer recourse problems. Technical report, University of South Florida, Tampa, FL.Google Scholar