Data-driven newsvendor problem: Performance of the sample average approximation

M Lin, WT Huh, H Krishnan… - Operations …, 2022 - pubsonline.informs.org
We consider the data-driven newsvendor problem in which a manager makes inventory
decisions sequentially and learns the unknown demand distribution based on observed …

Sample complexity of policy learning for inventory control with censored demand

X Fan, B Chen, Z Zhou - Available at SSRN 4178567, 2022 - papers.ssrn.com
Traditional offline-learning studies in inventory control assume access to true demand
samples $\{d_n\} _ {n= 1}^{N} $. However, in many applications, true demand samples are …

Sailing through the Dark: Provably Sample-Efficient Inventory Control

H Qin, D Simchi-Levi, R Zhu - Available at SSRN 4652347, 2023 - papers.ssrn.com
We consider the important open problems of 1) What is the sample complexity (ie, how many
data samples are needed) of learning nearly optimal policy for multi-stage stochastic …

A Nonparametric Learning Algorithm for a Stochastic Multi-echelon Inventory Problem

C Yang, WT Huh - Production and Operations Management, 2024 - journals.sagepub.com
We consider a periodic-review single-product multi-echelon inventory problem with
instantaneous replenishment. In each period, the decision-maker makes ordering decisions …

[图书][B] Single-stage approximations of multi-echelon inventory models

KH Shang, JSJ Song, SX Zhou - 2023 - elgaronline.com
For supply-chain systems with complex network structures, the forms of system-optimal
inventory-control policies are often not known. Even for systems with known optimal policies …

Closing the Gaps: Optimality of Sample Average Approximation for Data-Driven Newsvendor Problems

J Lyu, S Yuan, B Zhou, Y Zhou - arXiv preprint arXiv:2407.04900, 2024 - arxiv.org
We study the regret performance of Sample Average Approximation (SAA) for data-driven
newsvendor problems with general convex inventory costs. In literature, the optimality of …