Adaptive Distributionally Robust Optimization

We develop a modular and tractable framework for solving an adaptive distributionally robust linear optimization problem, where we minimize the worst-case expected cost over an ambiguity set of probability distributions. The adaptive distributionally robust optimization framework caters for dynamic decision making, where decisions adapt to the uncertain outcomes as they unfold in stages. For tractability considerations, we focus on a class of second-order conic (SOC) representable ambiguity set, though our results can easily be extended to more general conic representations. We show that the adaptive distributionally robust linear optimization problem can be formulated as a classical robust optimization problem. To obtain a tractable formulation, we approximate the adaptive distributionally robust optimization problem using linear decision rule (LDR) techniques. More interestingly, by incorporating the primary and auxiliary random variables of the lifted ambiguity set in the LDR approximation, we can significantly improve the solutions, and for a class of adaptive distributionally robust optimization problems, exact solutions can also be obtained. Using the new LDR approximation, we can transform the distributionally adaptive robust optimization problem to a classical robust optimization problem with an SOC representable uncertainty set. Finally, to demonstrate the potential for solving management decision problems, we develop an algebraic modeling package and illustrate how it can be used to facilitate modeling and obtain high-quality solutions for medical appointment scheduling and inventory management problems. The electronic companion is available at https://doi.org/10.1287/mnsc.2017.2952 . This paper was accepted by Noah Gans, optimization.

• 저널Management Science · 65(2) · 604–618
• 토픽Risk and Portfolio Optimization · Management Science and Operations Research
• DOI10.1287/mnsc.2017.2952
• 저자Dimitris Bertsimas, Melvyn Sim, Meilin Zhang