1,330
Views
12
CrossRef citations to date
0
Altmetric
Original Articles

A data-driven distributionally robust newsvendor model with a Wasserstein ambiguity set

, &
Pages 1879-1897 | Received 25 Feb 2019, Accepted 18 Mar 2020, Published online: 25 May 2020

References

  • Arjovsky, M., Chintala, S., & Bottou, L. (2017). Wasserstein GAN. arXiv preprint arXiv:1701.07875.
  • Bayraksan, G. & Love, D. K. (2015). Data-driven stochastic programming using phi-divergences. D. Aleman & A. Thiele (Eds.), The operations research revolution, Tutorials in Operations Research (pp. 1–19). Catonsville, MD: INFORMS. doi:10.1287/educ.2015.0134.
  • Ben-Tal, A., Den Hertog, D., De Waegenaere, A., Melenberg, B., & Rennen, G. (2013). Robust solutions of optimization problems affected by uncertain probabilities. Management Science, 59(2), 341–357. doi:10.1287/mnsc.1120.1641
  • Bertsimas, D., Doan, X. V., Natarajan, K., & Teo, C.-P. (2010). Models for minimax stochastic linear optimization problems with risk aversion. Mathematics of Operations Research, 35(3), 580–602. doi:10.1287/moor.1100.0445
  • Bertsimas, D., Gupta, V., & Kallus, N. (2018). Robust sample average approximation. Mathematical Programming, 171(1-2), 217–282. doi:10.1007/s10107-017-1174-z
  • Chen, Y., Xu, M., & Zhang, Z. G. (2009). A risk-averse newsvendor model under the CVaR criterion. Operations Research, 57(4), 1040–1044. doi:10.1287/opre.1080.0603
  • Delage, E., & Ye, Y. (2010). Distributionally robust optimization under moment uncertainty with application to data-driven problems. Operations Research, 58(3), 595–612. doi:10.1287/opre.1090.0741
  • Esfahani, P. M., & Kuhn, D. (2018). Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Mathematical Programming, 171(1-2), 115–166. doi:10.1007/s10107-017-1172-1
  • Fournier, N., & Guillin, A. (2015). On the rate of convergence in Wasserstein distance of the empirical measure. Probability Theory and Related Fields, 162(3-4), 707–738. doi:10.1007/s00440-014-0583-7
  • Gallego, G., & Moon, I. (1993). The distribution free newsboy problem: Review and extensions. The Journal of the Operational Research Society, 44(8), 825–834. doi:10.2307/2583894
  • Gao, R., & Kleywegt, A. J. (2016). Distributionally robust stochastic optimization with Wasserstein distance. arXiv preprint arXiv:1604.02199.
  • Goh, J., & Sim, M. (2010). Distributionally robust optimization and its tractable approximations. Operations Research, 58(4-part-1), 902–917. doi:10.1287/opre.1090.0795
  • Gotoh, J-y., & Takano, Y. (2007). Newsvendor solutions via conditional value-at-risk minimization. European Journal of Operational Research, 179(1), 80–96. doi:10.1016/j.ejor.2006.03.022
  • Hanasusanto, G. A., Kuhn, D., Wallace, S. W., & Zymler, S. (2015). Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Mathematical Programming, 152(1-2), 1–32. doi:10.1007/s10107-014-0776-y
  • Jiang, R., & Guan, Y. (2016). Data-driven chance constrained stochastic program. Mathematical Programming, 158(1-2), 291–327. doi:10.1007/s10107-015-0929-7
  • Natarajan, K., Sim, M., & Uichanco, J. (2018). Asymmetry and ambiguity in newsvendor models. Management Science, 64(7), 3146–3167. doi:10.1287/mnsc.2017.2773
  • Perakis, G., & Roels, G. (2008). Regret in the newsvendor model with partial information. Operations Research, 56(1), 188–203. doi:10.1287/opre.1070.0486
  • Pflug, G. C., & Pichler, A. (2014). Multistage stochastic optimization. Springer.
  • Pichler, A., & Xu, H. (2017). Quantitative stability analysis for minimax distributionally robust risk optimization. Mathematical Programming, 1–31. doi:10.1007/s10107-018-1347-4
  • Rockafellar, R. T., & Uryasev, S. (2000). Optimization of conditional value-at-risk. The Journal of Risk, 2(3), 21–42. doi:10.21314/JOR.2000.038
  • Rudin, W. (1991). Functional analysis. McGrawHill Inc.
  • Saghafian, S., & Tomlin, B. (2016). The newsvendor under demand ambiguity: Combining data with moment and tail information. Operations Research, 64(1), 167–185. doi:10.1287/opre.2015.1454
  • Scarf, H. (1958). A min-max solution of an inventory problem. Studies in the Mathematical Theory of Inventory and Production.
  • Shafieezadeh-Abadeh, S., Kuhn, D., & Esfahani, P. M. (2019). Regularization via mass transportation. Journal of Machine Learning Research, 20(103), 1–68.
  • Sun, H., & Xu, H. (2016). Convergence analysis for distributionally robust optimization and equilibrium problems. Mathematics of Operations Research, 41(2), 377–401. doi:10.1287/moor.2015.0732
  • Tolstikhin, I., Bousquet, O., Gelly, S., & Schoelkopf, B. (2017). Wasserstein Auto-Encoders. arXiv preprint arXiv:1711.01558.
  • Villani, C. (2009). Optimal transport: old and new. Springer Science & Business Media.
  • Wang, Z., Glynn, P. W., & Ye, Y. (2016). Likelihood robust optimization for data-driven problems. Computational Management Science, 13(2), 241–261. doi:10.1007/s10287-015-0240-3
  • Wiesemann, W., Kuhn, D., & Sim, M. (2014). Distributionally robust convex optimization. Operations Research, 62(6), 1358–1376. doi:10.1287/opre.2014.1314
  • Wozabal, D. (2012). A framework for optimization under ambiguity. Annals of Operations Research, 193(1), 21–47. doi:10.1007/s10479-010-0812-0
  • Yue, J., Chen, B., & Wang, M.-C. (2006). Expected value of distribution information for the newsvendor problem. Operations Research, 54(6), 1128–1136. doi:10.1287/opre.1060.0318
  • Zhao, C., & Guan, Y. (2018). Data-driven risk-averse stochastic optimization with Wasserstein metric. Operations Research Letters, 46(2), 262–267. doi:10.1016/j.orl.2018.01.011
  • Zhu, Z., Zhang, J., & Ye, Y. (2013). Newsvendor optimization with limited distribution information. Optimization Methods and Software, 28(3), 640–667. doi:10.1080/10556788.2013.768994

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.