The Data-Driven Newsvendor Problem: New Bounds and Insights
Retsef Levi, Georgia Perakis, Joline Uichanco
Operations Research · 2015 · Volume 63 · Issue 6
Abstract
Consider the newsvendor model, but under the assumption that the underlying demand distribution is not known as part of the input. Instead, the only information available is a random, independent sample drawn from the demand distribution. This paper analyzes the sample average approximation (SAA) approach for the data-driven newsvendor problem. We obtain a new analytical bound on the probability that the relative regret of the SAA solution exceeds a threshold. This bound is significantly tighter than existing bounds, and it matches the empirical accuracy of the SAA solution observed in extensive computational experiments. This bound reveals that the demand distribution’s weighted mean spread affects the accuracy of the SAA heuristic.
Keywords
data-driven stochastic program, newsvendor problem, sample average approximation, weighted mean spread
Enable JavaScript for citation tools and additional paper interactions.