The Data-Driven Newsvendor Problem: New Bounds and Insights

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

References

  • Akcay A, Biller B, Tayur S (2011) Improved inventory targets in the presence of limited historical demand data. Manufacturing Service Oper. Management 13(3):297–309.LinkGoogle Scholar
  • An MY (1995) Log-concave probability distributions: Theory and statistical testing. Technical report, Economics Department, Duke University, Durham, NC.Google Scholar
  • Asmussen S, Glynn P (2007) Stochastic Simulation: Algorithms and Analysis, Chapter 4 (Springer, New York), 77–80.CrossrefGoogle Scholar
  • Ball M, Queyranne M (2009) Toward robust revenue management: Competitive analysis of online booking. Oper. Res. 57:950–963.LinkGoogle Scholar
  • Bernstein SN (1927) Theory of Probability (Gostehizdat, Moscow).Google Scholar
  • Besbes O, Muharremoglu A (2013) On implications of demand censoring in the newsvendor problem. Management Sci. 59(6):1407–1424.LinkGoogle Scholar
  • Bookbinder JH, Lordahl AE (1989) Estimation of inventory reorder level using the bootstrap statistical procedure. IEE Trans. 21:302–312.CrossrefGoogle Scholar
  • Chandra NK, Roy D (2001) Some results on reversed hazard rate. Probab. Eng. Informational Sci. 15:95–102.CrossrefGoogle Scholar
  • Eren S, Maglaras C (2006) Revenue management heuristics under limited market information: A maximum entropy approach. Presented at 6th Annual INFORMS Revenue Management Conf., Columbia University, New York.Google Scholar
  • Flaxman AD, Kalai AT, McMahan HB (2005) Online convex optimization in the bandit setting: Gradient descent without a gradient. Proc. Sixteenth Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ‘05 (SIAM, Philadelphia), 385–394.Google Scholar
  • Gallego G, Moon I (1993) The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. 44(8):825–834.CrossrefGoogle Scholar
  • Glasserman P (1991) Gradient Estimation via Perturbation Analysis (Kluwer Academic Publishers, Norwell, MA).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
  • Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58:13–30.CrossrefGoogle Scholar
  • Homem-De-Mello T (2000) Monte Carlo methods for discrete stochastic optimization. Uryasev S, Pardalos PM, eds. Stochastic Optimization: Algorithms and Applications (Kluwer Academic Publishers, Norwell, MA), 95–117.Google Scholar
  • Huh WT, Rusmevichientong P (2009) A nonparametric asymptotic analysis of inventory planning with censored data. Math. Oper. Res. 34(1):103–123.LinkGoogle Scholar
  • Huh WT, Levi R, Rusmevichientong P, Orlin J (2008) Adaptive data-driven inventory control with censored demand based on Kaplan-Meier estimator. Oper. Res. 59(4):924–941.Google Scholar
  • Kleywegt AJ, Shapiro A, Homem-De-Mello T (2001) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12:479–502.CrossrefGoogle Scholar
  • Levi R, Perakis G, Uichanco J (2011) Regret optimization for stochastic inventory models with spread information. Working paper, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
  • Levi R, Roundy R, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4):821–839.LinkGoogle Scholar
  • Liyanage LH, Shanthikumar JG (2005) A practical inventory control policy using operational statistics. Oper. Res. Lett. 33:341–348.CrossrefGoogle Scholar
  • Perakis G, Roels G (2008) Regret in the newsvendor model with partial information. Oper. Res. 56(1):188–203.LinkGoogle Scholar
  • Rockafellar RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
  • Scarf H (1959) Bayes solution to the statistical inventory problem. Ann. Math. Statist. 30(2):490–508.CrossrefGoogle Scholar
  • Scarf HE (1958) A min-max solution to an inventory problem. Arrow KJ, Karlin S, Scarf HE, eds. Studies in Mathematical Theory of Inventory and Production (Stanford Univerity Press, Stanford, CA), 201–209.Google Scholar
  • Sengupta D, Nanda A (1997) Log-concave and concave distributions in reliability. Naval Res. Logist. 46:419–433.CrossrefGoogle Scholar
  • Sengupta D, Paul D (2005) Some tests for log-concavity of life distributions. Preprint available at http://anson.ucdavis.edu/~debashis/techrep/logconca.pdf.Google Scholar
  • Shapiro A (2008) Stochastic programming approach to optimization under uncertainty. Math. Programming 112:183–220.CrossrefGoogle Scholar
  • Swamy C, Shmoys DB (2005) Sampling-based approximation algorithms for multi-stage stochastic optimization. Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci, FOCS ‘05 (IEEE Computer Society, Washington, DC).CrossrefGoogle Scholar
  • Zipkin PH (2000) Foundations of Inventory Management (The McGraw-Hill Companies, New York).Google 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.