Risk-Adaptive Local Decision Rules

Published Online:https://doi.org/10.1287/opre.2023.0564

References

  • 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.LinkGoogle Scholar
  • Attouch H, Wets RJ (1993) Quantitative stability of variational systems: III. ε-approximate solutions. Math. Programming 61:197–214.CrossrefGoogle Scholar
  • Awasthi P, Goyal V, Lu BY (2019) On the adaptivity gap in two-stage robust linear optimization under uncertain constraints. Math. Programming 173(1–2):313–352.CrossrefGoogle Scholar
  • Bampou D, Kuhn D (2011) Scenario-free stochastic programming with polynomial decision rules. 2011 Proc. 50th IEEE Conf. Decision Control Eur. Control Conf. (CDC-ECC) (IEEE, Piscataway, NJ), 7806–7812.Google Scholar
  • Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
  • Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.CrossrefGoogle Scholar
  • Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: A methodological tour d’horizon. Eur. J. Oper. Res. 290(2):405–421.CrossrefGoogle 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.CrossrefGoogle Scholar
  • Bertsimas D, Caramanis C (2007) Adaptability via sampling. Proc. 46th IEEE Conf. Decision Control (IEEE, Piscataway, NJ), 4717–4722.Google Scholar
  • Bertsimas D, Caramanis C (2010) Finite adaptability in multistage linear optimization. IEEE Trans. Automated Control 55(12):2751–2766.CrossrefGoogle Scholar
  • Bertsimas D, Dunning I (2016) Multistage robust mixed-integer optimization with adaptive partitions. Oper. Res. 64(4):980–998.LinkGoogle Scholar
  • Bertsimas D, Georghiou A (2015) Design of near optimal decision rules in multistage adaptive mixed-integer optimization. Oper. Res. 63(3):610–627.LinkGoogle Scholar
  • Bertsimas D, Georghiou A (2018) Binary decision rules for multistage adaptive mixed-integer optimization. Math. Programming 167:395–433.CrossrefGoogle Scholar
  • Bertsimas D, Goyal V (2013) On the approximability of adjustable robust convex optimization under uncertainty. Math. Methods Oper. Res. 77(3):323–343.CrossrefGoogle Scholar
  • Bertsimas D, Goyal V, Lu BY (2015) A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization. Math. Programming 150(2):281–319.CrossrefGoogle Scholar
  • Bertsimas D, Iancu DA, Parrilo PA (2010) Optimality of affine policies in multistage robust optimization. Math. Oper. Res. 35(2):363–394.LinkGoogle Scholar
  • Bertsimas D, Iancu D, Parrilo P (2011) A hierarchy of near-optimal policies for multistage adaptive optimization. IEEE Trans. Automated Control 56(12):2809–2824.CrossrefGoogle Scholar
  • Bertsimas D, Shtern S, Sturt B (2022) Technical note—Two-stage sample robust optimization. Oper. Res. 70(1):624–640.LinkGoogle Scholar
  • Brown GG, Graves G (1975) Elastic programming: A new approach to large-scale mixed integer optimization. Proc. ORSA/TIMS Conf. (Las Vegas, NV).Google Scholar
  • Charnes A, Cooper WW, Symonds GH (1958) Cost horizons and certainty equivalents: An approach to stochastic programming of heating oil. Management Sci. 4(3):235–263.LinkGoogle Scholar
  • Chen X, Zhang Y (2009) Uncertain linear programs: Extended affinely adjustable robust counterparts. Oper. Res. 57(6):1469–1482.LinkGoogle 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.LinkGoogle Scholar
  • Cui Y, Liu J, Pang JS (2022) Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs. Set-Valued Variance Anal. 30(3):1149–1211.CrossrefGoogle Scholar
  • Delage E, Iancu DA (2015) Robust multistage decision making. Aleman DM, Thiele AC, eds. Tutorials in Operations Research: The Operations Research Revolution (INFORMS, Cantonsville, MD), 20–46.LinkGoogle Scholar
  • Drusvyatskiy D, Lewis AS (2013) Tilt stability, uniform quadratic growth, and strong metric regularity of the subdifferential. SIAM J. Optim. 23:256–267.CrossrefGoogle Scholar
  • Eberhard AC, Wenczel R (2012) A study of tilt-stable optimality and sufficient conditions. Nonlinear Anal. 75:1260–1281.CrossrefGoogle Scholar
  • El Housni O, Goyal V (2017) Beyond worst-case: A probabilistic analysis of affine policies in dynamic optimization. Proc. 31st Conf. Neural Inform. Processing Systems (Curran Associates Inc., Red Hook, NY), 4756–4764.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.LinkGoogle Scholar
  • Garstka SJ, Wets RJ (1974) On decision rules in stochastic programming. Math. Programming 7(1):117–143.CrossrefGoogle Scholar
  • Gasse M, Cappart Q, Charfreitag J, Charlin L, Chetelat D, Chmiela A, Dumouchelle J, et al. (2022) The machine learning for combinatorial optimization competition (ml4co): Results and insights. Proc. Machine Learn. Res. 176:220–231.Google Scholar
  • Georghiou A, Kuhn D, Wiesemann W (2019) The decision rule approach to optimization under uncertainty: Methodology and applications. Comput. Management Sci. 16(4):545–576.CrossrefGoogle Scholar
  • Georghiou A, Tsoukalas A, Wiesemann W (2021) On the Optimality of Affine Decision Rules in Robust and Distributionally Robust Optimization (Optimization Online).Google Scholar
  • Georghiou A, Wiesemann W, Kuhn D (2015) Generalized decision rule approximations for stochastic programming via liftings. Math. Programming 152:301–338.CrossrefGoogle Scholar
  • Goerigk M, Hartisch M (2023) A framework for inherently interpretable optimization models. Eur. J. Oper. Res. 310(3):1312–1324.CrossrefGoogle Scholar
  • Goh J, Sim M (2010) Distributionally robust optimization and its tractable approximations. Oper. Res. 58(4-part-1):902–917.LinkGoogle Scholar
  • Gotoh J, Kim MJ, Lim AEB (2021) Calibration of distributionally robust empirical optimization models. Oper. Res. 69(5):1630–1650.LinkGoogle Scholar
  • Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper. Res. 61(3):677–693.LinkGoogle Scholar
  • Hadjiyiannis MJ, Goulart PJ, Kuhn D (2011) A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization. Proc. 50th IEEE Conf. Decision Control Eur. Control Conf. (IEEE, Piscataway, NJ), 7386–7391.Google Scholar
  • Hanasusanto GA, Kuhn D, Wiesemann W (2015) k-adaptability in two-stage robust binary programming. Oper. Res. 63(4):877–891.LinkGoogle Scholar
  • Ioffe AD, Outrata JV (2008) On metric and calmness qualification conditions in subdifferential calculus. Set-Valued Variance Anal. 16(2–3):199–227.CrossrefGoogle Scholar
  • Kotary J, Fioretto F, Van Hentenryck P, Wilder B (2021) End-to-end constrained optimization learning: A survey. Proc. 30th Internat. Joint Conf. Artificial Intelligence (ijcai.org).Google Scholar
  • Kuhn D, Wiesemann W, Georghiou A (2011) Primal and dual linear decision rules in stochastic and robust optimization. Math. Programming 130:177–209.CrossrefGoogle Scholar
  • Laguel Y, Pillutla K, Malick J, Harchaoui Z (2021a) A superquantile approach to federated learning with heterogeneous devices. Proc. 55th Annual Conf. Inform. Sci. Systems (IEEE, Piscataway, NJ), 1–6.Google Scholar
  • Laguel Y, Pillutla K, Malick J, Harchaoui Z (2021b) Superquantiles at work: Machine learning applications and efficient subgradient computation. Set-Valued Variance Anal. 29:967–996.CrossrefGoogle Scholar
  • Lejeune M, Royset JO, Ma W (2024) Multi-agent search for a moving and camouflaging target. Naval Res. Logist. 71(4):532–552.CrossrefGoogle Scholar
  • Levy D, Carmon Y, Duchi J, Sidford A (2020) Large-scale methods for distributionally robust optimization. Larochelle H, Ranzato M, Hadsell R, Balcan MF, Lin H, eds. Advances in Neural Information Processing Systems, vol. 33 (Curran Associates Inc., Red Hook, NY), 8847–8860.Google Scholar
  • Lewis AS, Zhang S (2013) Partial smoothness, tilt stability, and generalized Hessians. SIAM J. Optim. 23:74–94.CrossrefGoogle Scholar
  • Liu X, Lu Y, Abbasi A, Li M, Mohammadi J, Kolouri S (2024) Teaching networks to solve optimization problems. IEEE Access 12:17102–17113.CrossrefGoogle Scholar
  • Mordukhovich BS, Rockafellar RT, Sarabi ME (2013) Characterizations of full stability in constrained optimization. SIAM J. Optim. 23:1810–1849.CrossrefGoogle Scholar
  • Penña-Ordieres A, Luedtke J, Wächter A (2020) Solving chance-constrained problems via a smooth sample-based nonlinear approximation. SIAM J. Optim. 30(3):2221–2250.CrossrefGoogle Scholar
  • Penot JP (2010) Error bounds, calmness and their applications in nonsmooth analysis. Contemporary Math. 514:225–247.CrossrefGoogle 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.LinkGoogle Scholar
  • Rahal S, Li Z, Papageorgiou DJ (2022) Deep lifted decision rules for two-stage adaptive optimization problems. Comput. Chemical Engrg. 159:107661.CrossrefGoogle Scholar
  • Rockafellar RT, Royset JO (2010) On buffered failure probability in design and optimization of structures. Reliability Engrg. Systems Safety 95:499–510.CrossrefGoogle Scholar
  • Rockafellar RT, Uryasev S (2013) The fundamental risk quadrangle in risk management, optimization and statistical estimation. Survey Oper. Res. Management Sci. 18:33–53.CrossrefGoogle Scholar
  • Rockafellar RT, Wets RJ (1998) Variational Analysis (Springer, Berlin).CrossrefGoogle Scholar
  • Royset JO (2020) Stability and error analysis for optimization and generalized equations. SIAM J. Optim. 30(1):752–780.CrossrefGoogle Scholar
  • Royset JO (2021) Good and bad optimization models: Insights from Rockafellians. Carlsson JG, ed. Tutorials in Operations Research: Emerging Optimization Methods and Modeling Techniques with Applications (INFORMS, Cantonsville, MD), 131–160.LinkGoogle Scholar
  • Royset JO (2024) Risk-adaptive approaches to stochastic optimization: A survey. SIAM Rev. Forthcoming.Google Scholar
  • Royset JO, Sato H (2010) Route optimization for multiple searchers. Naval Res. Logist. 57(8):701–717.CrossrefGoogle Scholar
  • Royset JO, Wets RJB (2021) An Optimization Primer (Springer, Berlin).CrossrefGoogle Scholar
  • Shi Y, Zhang Y (2022) The neural network methods for solving traveling salesman problem. Proc. Comput. Sci. 199:681–686.CrossrefGoogle Scholar
  • Simchi-Levi D, Trichakis N, Zhang PY (2019) Designing response supply chain against bioattacks. Oper. Res. 67(5):1246–1268.LinkGoogle Scholar
  • Subramanyam A, Gounaris CE, Wiesemann W (2020) k-adaptability in two-stage mixed-integer robust optimization. Math. Programming Comput. 12:193–224.CrossrefGoogle Scholar
  • Takeda A, Taguchi S, Tutuncu RH (2008) Adjustable robust optimization models for a nonlinear two-period system. J. Optim. Theory Appl. 136(2):275–295.CrossrefGoogle 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
  • Wets RJ (1974) Stochastic programs with fixed recourse: The equivalent deterministic program. SIAM Rev. 16(3):309–339.CrossrefGoogle Scholar
  • Yanikoglu I, Gorissen GL, den Hertog D (2019) A survey of adjustable robust optimization. Eur. J. Oper. Res. 277(3):799–813.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.