A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization

References

• Abbeel P, Ng AY (2004) Apprenticeship learning via inverse reinforcement learning. Proc. 21st Internat. Conf. Machine Learn. (ACM, New York), 1–8.Google Scholar
• Bampou D, Kuhn D (2011) Scenario-free stochastic programming with polynomial decision rules. Proc. 50th IEEE Conf. Decision Control Eur. Control Conf. (IEEE, Piscataway, NJ), 7806–7812.Google Scholar
• Baty L, Jungel K, Klein PS, Parmentier A, Schiffer M (2024) Combinatorial optimization-enriched machine learning to solve the dynamic vehicle routing problem with time windows. Transportation Sci. 58(4):708–725.Link, Google Scholar
• Ben-Tal A, Housni OE, Goyal V (2020) A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization. Math. Programming 182(1–2):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
• 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, 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, Kallus N (2020) From predictive to prescriptive analytics. Management Sci. 66(3):1025–1044.Link, Google Scholar
• Bertsimas D, Goyal V, Sun XA (2011a) 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, Iancu DA, Parrilo PA (2011b) 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 (2023) A data-driven approach to multistage stochastic linear optimization. Management Sci. 69(1):51–74.Link, 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 X, Zhang Y (2009) Uncertain linear programs: Extended affinely adjustable robust counterparts. Oper. Res. 57(6):1469–1482.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
• Feige U, Jain K, Mahdian M, Mirrokni V (2007) Robust combinatorial optimization with exponential scenarios. Fischetti M, Williamson DP, eds. Integer Programming and Combinatorial Optimization (Springer, Berlin), 439–453.Crossref, Google Scholar
• François-Lavet V, Henderson P, Islam R, Bellemare MG, Pineau J (2018) An introduction to deep reinforcement learning. Foundations Trends Machine Learn. 11(3–4):219–354.Crossref, Google Scholar
• Gao R, Kleywegt A (2023) Distributionally robust stochastic optimization with Wasserstein distance. Math. Oper. Res. 48(2):603–655.Link, Google Scholar
• Georghiou A, Wiesemann W, Kuhn D (2015) Generalized decision rule approximations for stochastic programming via liftings. Math. Programming 152(1–2):301–338.Crossref, Google Scholar
• Goh J, Sim M (2010) Distributionally robust optimization and its tractable approximations. Oper. Res. 58(4):902–917.Link, Google Scholar
• Graves SC (1999) A single-item inventory model for a nonstationary demand process. Manufacturing Service Oper. Management 1(1):50–61.Link, Google Scholar
• Guslitser E (2002) Uncertainty-immunized solutions in linear programming. MS thesis, Technion, Israel Institute of Technology, Haifa.Google Scholar
• Han E, Nohadani O (2025) Nonlinear decision rules made scalable by nonparametric liftings. Management Sci. 71(4):3449–3471.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
• Laguna M (1998) Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty. Management Sci. 44(11-part-2):101–110.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
• Muth JF (1960) Optimal properties of exponentially weighted forecasts. J. Amer. Statist. Assoc. 55(290):299–306.Crossref, Google Scholar
• Powell WB (2011) Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley, New York).Crossref, Google Scholar
• Puterman ML (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming (Wiley, New York).Crossref, Google Scholar
• Rahal S, Papageorgiou DJ, Li Z (2021) Hybrid strategies using linear and piecewise-linear decision rules for multistage adaptive linear optimization. Eur. J. Oper. Res. 290(3):1014–1030.Crossref, Google Scholar
• See CT, Sim M (2010) Robust approximation to multiperiod inventory management. Oper. Res. 58(3):583–594.Link, Google Scholar
• Thomä S, Walther G, Schiffer M (2024) Designing tractable piecewise affine policies for multi-stage adjustable robust optimization. Math. Programming 208(1–2):661–716.Crossref, Google Scholar
• Vayanos P, Kuhn D, Rustem B (2011) Decision rules for information discovery in multi-stage stochastic programming. Proc. 50th IEEE Conf. Decision Control Eur. Control Conf. (IEEE, Piscataway, NJ), 7368–7373.Google Scholar
• Wang Z, Qi M (2020) Robust service network design under demand uncertainty. Transportation Sci. 54(3):676–689.Link, Google Scholar