Smart Predict-then-Optimize for Two-Stage Linear Programs with Side Information

References

• Akgul M (1984) A note on lexicographic linear programming. INFOR Inform. Systems Oper. Res. 22(4):343.Google Scholar
• Ban GY, Rudin C (2019) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108.Link, Google Scholar
• Bengio Y (1997) Using a financial training criterion rather than a prediction criterion. Internat. J. Neural Systems 08(04):433–443.Google Scholar
• Berthet Q, Blondel M, Teboul O, Cuturi M, Vert JP, Bach F (2020) Learning with differentiable perturbed optimizers. Larochelle H, Ranzato M, Hadsell R, Balcan M, Lin H, eds. Adv. Neural Inform. Processing Systems 23 (Curran Associates, Inc., Red Hook, NY), 9508–9519.Google Scholar
• Bertsimas D, Kallus N (2020) From predictive to prescriptive analytics. Management Sci. 66(3):1025–1044.Link, Google Scholar
• Bertsimas D, McCord C (2019) From predictions to prescriptions in multistage optimization problems. Preprint, submitted April 26, https://arxiv.org/abs/1904.11637.Google Scholar
• Bertsimas D, Tsitsiklis JN (1997) Introduction to Linear Optimization (Athena Scientific, Nashua, NH).Google Scholar
• Bertsimas D, McCord C, Sturt B (2023) Dynamic optimization with side information. Eur. J. Oper. Res. 304(2):634–651.Google Scholar
• Birge JR, Louveaux F (2011) Introduction to Stochastic Programming, 2nd ed. (Springer, New York).Google Scholar
• Buttler S, Philippi A, Stein N, Pibernik R (2022) A meta analysis of data-driven newsvendor approaches. ML Evaluation Standards Workshop, ICLR 2022. https://ml-eval.github.io/accepted-papers/.Google Scholar
• Cheney EW, Goldstein AA (1959) Newton’s method for convex programming and Tchebycheff approximation. Numerische Math. 1(1):253–268.Google Scholar
• Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming, 1st ed. (Springer, Cham, Switzerland).Google Scholar
• Cox J, Kochenderfer MJ (2015) Optimization approaches to the single airport ground-holding problem. J. Guidance Control Dynam. 38(12):2399–2406.Google Scholar
• Donti PL, Amos B, Kolter JZ (2017) Task-based end-to-end model learning in stochastic optimization. Guyon I, Von Luxburg U, Bengio S, Wallach H, Fergus R, Vishwanathan S, Garnett R, eds. Adv. Neural Inform. Processing Systems, vol. 30 (Curran Associates, Inc., Red Hook, NY), 5484–5494.Google Scholar
• El Balghiti O, Elmachtoub AN, Grigas P, Tewari A (2019) Generalization bounds in the predict-then-optimize framework. Preprint, submitted May 27, https://arxiv.org/abs/1905.11488v1.Google Scholar
• Elmachtoub A, Liang JCN, Mcnellis R (2020) Decision trees for decision-making under the predict-then-optimize framework. Daumé H III, Singh A, eds. Proc. 37th Internat. Conf. Machine Learn., vol. 119 (PMLR), 2858–2867.Google Scholar
• Elmachtoub AN, Grigas P (2022) Smart “predict, then optimize.” Management Sci. 68(1):9–26.Link, Google Scholar
• Estes AS, Ball MO (2020) Equity and strength in stochastic integer programming models for the dynamic single airport ground-holding problem. Transportation Sci. 54(4):944–955.Link, Google Scholar
• Ferber A, Wilder B, Dilkina B, Tambe M (2020) MIPaaL: Mixed Integer Program as a Layer. Proc. Conf. AAAI Artificial Intelligence, 34(2):1504–1511.Google Scholar
• Hannah L, Powell W, Blei DM (2010) Nonparametric density estimation for stochastic optimization with an observable state variable. Lafferty JD, Williams CKI, Shawe-Taylor J, Zemel RS, Culotta A, eds. Adv. Neural Inform. Processing Systems 23 (Curran Associates, Inc., Red Hook, NY), 820–828.Google Scholar
• Higle JL, Sen S (1996) A Statistical Method for Large Scale Stochastic Linear Programming (Kluwer Academic Publishers, Dordrecht, Netherlands).Google Scholar
• Ho-Nguyen N, Kılınç-Karzan F (2022) Risk guarantees for end-to-end prediction and optimization processes. Management Sci. 68(12):8680–8698.Link, Google Scholar
• Hu Y, Kallus N, Mao X (2022) Fast rates for contextual linear optimization. Management Sci. 68(6):4236–4245.Link, Google Scholar
• Jones C, Kerrigan E, Maciejowski J (2007) Lexicographic perturbation for multiparametric linear programming with applications to control. Automatica 43(10):1808–1816.Google Scholar
• Kallus N, Mao X (2022) Stochastic optimization forests. Management Sci., ePub ahead of print June 28, https://doi.org/10.1287/mnsc.2022.4458.Google Scholar
• Kao YH, Roy BV, Yan X (2009) Directed regression. Bengio Y, Schuurmans D, Lafferty JD, Culotta A, eds. Adv. Neural Inform. Processing Systems 22 (Curran Associates, Inc., Red Hook, NY), 889–897.Google Scholar
• Kelley JE Jr (1960) The cutting-plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8(4):703–712.Google Scholar
• Kotary J, Fioretto F, Van Hentenryck P, Wilder B (2021) End-to-end constrained optimization learning: A survey. Preprint, submitted March 30, https://arxiv.org/abs/2103.16378.Google Scholar
• Mandi J, Demirović E, Stuckey PJ, Guns T (2020) Smart predict-and-optimize for hard combinatorial optimization problems. Proc. Conf. AAAI Artificial Intelligence 34(2):1603–1610.Google Scholar
• Murça MCR, Hansman RJ (2018) Predicting and planning airport acceptance rates in metroplex systems for improved traffic flow management decision support. Transportation Res. Part C Emerging Tech. 97(2018):301–323.Google Scholar
• Pogančić MV, Paulus A, Musil V, Martius G, Rolinek M (2020) Differentiation of blackbox combinatorial solvers. Proc. 8th Internat. Conf. Learn. Representations (International Conference on Learning Representations).Google Scholar
• Rockafellar RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A (2014) Lectures on Stochastic Programming: Modeling and Theory, 2nd ed. (SIAM, Philadelphia).Google Scholar
• Srivastava PR, Wang Y, Hanasusanto GA, Ho CP (2021) On data-driven prescriptive analytics with side information: A regularized Nadaraya–Watson approach. Preprint, submitted October 20, https://arxiv.org/abs/2110.04855.Google Scholar