A Robust Data-Driven Approach for the Newsvendor Problem with Nonparametric Information

Published Online:https://doi.org/10.1287/msom.2020.0961

References

  • Bayraksan G, Love DK (2015) Data-driven stochastic programming using phi-divergences. INFORMS Tutorials in Operations Research, https://doi.org/10.1287/educ.2015.0134.Google Scholar
  • Ben-Tal A, Hochman E (1976) Stochastic programs with incomplete information. Oper. Res. 24(2):336–347.LinkGoogle Scholar
  • Ben-Tal A, Den Hertog D, De Waegenaere A, Melenberg B, Rennen G (2013) Robust solutions of optimization problems affected by uncertain probabilities. Management Sci. 59(2):341–357.LinkGoogle Scholar
  • Gallego G, Moon I (1993) The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. 44(8):825–834.CrossrefGoogle Scholar
  • Gao R, Kleywegt AJ (2016) Distributionally robust stochastic optimization with Wasserstein distance. Preprint, submitted April 6, https://arxiv.org/abs/1604.02199.Google Scholar
  • Godfrey GA, Powell WB (2001) An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. 47(8):1101–1112.LinkGoogle Scholar
  • Goh J, Sim M (2010) Distributionally robust optimization and its tractable approximations. Oper. Res. 58(4 pt 1):902–917.Google Scholar
  • Hanasusanto GA, Kuhn D, Wallace SW, Zymler S (2015) Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Math. Programming 152(1–2):1–32.CrossrefGoogle Scholar
  • Huh WT, Rusmevichientong P (2009) A nonparametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34(1):103–123.LinkGoogle Scholar
  • Jiang R, Guan Y (2016) Data-driven chance constrained stochastic program. Math. Programming 158(1–2):291–327.CrossrefGoogle Scholar
  • Lariviere MA, Porteus EL (1999) Stalking information: Bayesian inventory management with unobserved lost sales. Management Sci. 45(3):346–363.LinkGoogle Scholar
  • Levi R, Perakis G, Uichanco J (2011) Regret optimization for stochastic inventory models with spread information. Oper. Res. 56(1):188–203.Google Scholar
  • Levi R, Roundy RO, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4):821–839.LinkGoogle 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.CrossrefGoogle Scholar
  • Natarajan K, Sim M, Uichanco J (2018) Asymmetry and ambiguity in newsvendor models. Management Sci. 64(7):3146–3167.LinkGoogle Scholar
  • Perakis G, Roels G (2008) Regret in the newsvendor model with partial information. Oper. Res. 56(1):188–203.LinkGoogle Scholar
  • Popescu I, Wu Y (2007) Dynamic pricing strategies with reference effects. Oper. Res. 55(3):413–429.LinkGoogle Scholar
  • Rosenblatt M (1956) Remarks on some nonparametric estimates of a density function. Ann. Math. Statist. 27(3):832–837.CrossrefGoogle Scholar
  • Rubner Y, Tomasi C, Guibas LJ (2000) The earth mover’s distance as a metric for image retrieval. Internat. J. Comput. Vision 40(2):99–121.CrossrefGoogle Scholar
  • Ruppert D, Cline DB (1994) Bias reduction in kernel density estimation by smoothed empirical transformations. Ann. Statist. 22(1):185–210.CrossrefGoogle Scholar
  • Scarf zH (1958) A min-max solution of an inventory problem. Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Redwood City, CA), 201–209.Google Scholar
  • Sun H, Xu H (2016) Convergence analysis for distributionally robust optimization and equilibrium problems. Math. Oper. Res. 41(2):377–401.LinkGoogle Scholar
  • Wang Z, Glynn PW, Ye Y (2016) Likelihood robust optimization for data-driven problems. Comput. Managment Sci. 13(2):241–261.CrossrefGoogle Scholar
  • Waterman M, Whiteman D (1978) Estimation of probability densities by empirical density functions. Internat. J. Math. Ed. Sci. Tech. 9(2):127–137.CrossrefGoogle Scholar
  • Yue J, Chen B, Wang MC (2006) Expected value of distribution information for the newsvendor problem. Oper. Res. 54(6):1128–1136.LinkGoogle Scholar
  • Zhao C, Guan Y (2018) Data-driven risk-averse stochastic optimization with Wasserstein metric. Oper. Res. Lett. 46(2):262–267.CrossrefGoogle Scholar
  • Zhu Z, Zhang J, Ye Y (2013) Newsvendor optimization with limited distribution information. Optim. Methods Software 28(3):640–667.CrossrefGoogle Scholar
  • Zuluaga LF, Peña J, Du D (2009) Third-order extensions of Lo’s semiparametric bound for European call options. Eur. J. Oper. Res. 198(2):557–570.CrossrefGoogle Scholar
  • Zymler S, Kuhn D, Rustem B (2013) Distributionally robust joint chance constraints with second-order moment information. Math. Programming 137(1–2):167–198.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.