Abstract
We propose a novel robust optimization approach to analyze and optimize the expected performance of supply chain networks. We model uncertainty in the demand at the sink nodes via polyhedral sets which are inspired from the limit laws of probability. We characterize the uncertainty sets by variability parameters which control the degree of conservatism of the model, and thus the level of probabilistic protection. At each level, and following the steps of the traditional robust optimization approach, we obtain worst case values which directly depend on the values of the variability parameters. We go beyond the traditional robust approach and treat the variability parameters as random variables. This allows us to devise a methodology to approximate and optimize the expected behavior via averaging the worst case values over the possible realizations of the variability parameters. Unlike stochastic analysis and optimization, our approach replaces the high-dimensional problem of evaluating expectations with a low-dimensional approximation that is inspired by probabilistic limit laws. We illustrate our approach by finding optimal base-stock and affine policies for fairly complex supply chain networks. Our computations suggest that our methodology (a) generates optimal base-stock levels that match the optimal solutions obtained via stochastic optimization within no more than 4 iterations, (b) yields optimal affine policies which often times exhibit better results compared to optimal base-stock policies, and (c) provides optimal policies that consistently outperform the solutions obtained via the traditional robust optimization approach.
Similar content being viewed by others
References
Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions. Dover, Mineola (1972)
Arrow, K., Harris, T., Marschak, J.: Optimal inventory policy. Econometrica XIX, 250–272 (1951)
Bandi, C., Bertsimas, D.: Tractable stochastic analysis via robust optimization. Math. Program. 134(1), 23–70 (2012)
Bandi, C., Bertsimas, D.: Optimal design for multi-item auctions: a robust optimization approach. Math. Oper. Res. 39(4), 1012–1038 (2014a)
Bandi, C., Bertsimas, D.: Robust option pricing. Eur. J. Oper. Res. 239(3), 842–853 (2014b)
Bandi, C., Bertsimas, D.: Channel coding via robust optimization, Part 1: the case of a single channel (submitted for publication) (2015a)
Bandi, C., Bertsimas, D.: Channel coding via robust optimization, Part 2: the multiple channel case (submitted for publication) (2015b)
Bandi, C., Bertsimas, D., Youssef, N.: Robust queueing theory. Oper. Res. 63(3), 676–700 (2015a)
Bandi, C., Bertsimas, D., Youssef, N.: Robust transient analysis of multi-server queues and feedforward queueing networks. Queueing Syst. 89(3–4), 351–413 (2018)
Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23(4), 769–805 (1998)
Ben-Tal, A., Nemirovski, A.: Robust solutions to uncertain programs. Oper. Res. Lett. 25, 1–13 (1999)
Ben-Tal, A., Golany, B., Nemirovski, A., Vial, J.-P.: Retailer-supplier flexible commitments contracts: a robust optimization approach. Manuf. Serv. Oper. Manag. 7(3), 248–271 (2005)
Ben-Tal, A., El-Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)
Bertsimas, D., Brown, D.B.: Constructing uncertainty sets for robust linear optimization. Oper. Res. 57(6), 1483–1495 (2009)
Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98, 49–71 (2003)
Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)
Bertsimas, D., Thiele, A.: Robust and data-driven optimization: modern decision making under uncertainty. Tutorials in Operations Research, pp. 95–122 (2006)
Bertsimas, D., Iancu, D., Parillo, P.: Optimality of affine policies in multistage robust optimization. Math. Oper. Res. 35(2), 363–394 (2010)
Bertsimas, D., Brown, D., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53, 464–501 (2011)
Bertsimas, D., Gupta, V., Kallus, N.: Data-driven robust optimization. Math. Prog. 167(2), 235–292 (2018)
Bienstock, D., Özbay, N.: Computing robust base-stock levels. Discrete Optim. 5(2), 389–414 (2008)
Clark, A., Scarf, H.: Optimal policies for a multi-echelon inventory problem. Manag. Sci. 6, 475–490 (1960)
El-Ghaoui, L., Lebret, H.: Robust solutions to least-square problems to uncertain data matrices. SIAM J. Matrix Anal. Appl. 18, 1035–1064 (1997)
El-Ghaoui, L., Oustry, F., Lebret, H.: Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9, 33–52 (1998)
Fu, M.: Sample path derivatives for \((s, s)\) inventory systems. Oper. Res. 42, 351–364 (1994)
Fu, M., Healy, K.: Techniques for simulation optimization: an experimental study on an \(({s},{S})\) inventory system. IIE Trans. 29(3), 191–199 (1997)
Fu, M., Glover, F., April, J.: Simulation optimization: a review, new developments, and applications. In: Simulation conference, 2005 Proceedings of the Winter, pp. 83–95 (2005)
Glasserman, P., Tayyur, S.: Sensitivity analysis for base-stock levels in multiechelon production-inventory systems. Manag. Sci. 41(2), 263–281 (1995)
Higle, J.L., Sen, S. Stochastic decomposition: A statistical method for large scale stochastic linear programming, vol. 8, pp 222. Springer, US (1996)
Kapiscinsky, R., Tayyur, S.: Optimal policies and simulation based optimization for capacitated production inventory systems (chapter). Kluwer Academic Publishers, Boston (1999)
Kuhn, D., Wiesmann, W., Georghiou, A.: Primal and dual linear decision rules in stochastic and robust optimization. Math. Program. 130(1), 177–209 (2011)
Acknowledgements
The authors would like to thank Chaithanya Bandi and Vishal Gupta for insightful discussions and offering us constructive feedback about our framework.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Bertsimas, D., Youssef, N. Stochastic optimization in supply chain networks: averaging robust solutions. Optim Lett 14, 839–855 (2020). https://doi.org/10.1007/s11590-019-01405-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-019-01405-0