Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models

作者: Retsef Levi , Robin O. Roundy , David B. Shmoys

DOI: 10.1287/MOOR.1070.0272

关键词:

摘要: In this paper, we consider two fundamental inventory models, the single-period newsvendor problem and its multiperiod extension, but under assumption that explicit demand distributions are not known only information available is a set of independent samples drawn from true distributions. Under given explicitly, these models well studied relatively straightforward to solve. However, in most real-life scenarios, available, or they too complex work with. Thus, sampling-driven algorithmic framework very attractive, both practice theory. We shall describe how compute sampling-based policies, is, policies computed based on observed demands without any access to, assumptions on, Moreover, establish bounds number required guarantee that, with high probability, expected cost arbitrarily close (i.e., small relative error) compared optimal which have full The develop general, easy compute, do depend at all specific

参考文章(38)
Moses Charikar, Chandra Chekuri, Martin Pál, Sampling Bounds for Stochastic Optimization Lecture Notes in Computer Science. ,vol. 3624, pp. 257- 269 ,(2005) , 10.1007/11538462_22
Jasmina L Vujic, Monte Carlo Sampling Methods Handbooks in Operations Research and Management Science. ,vol. 10, pp. 353- 425 ,(2003) , 10.1016/S0927-0507(03)10006-0
Dimitris Bertsimas, Aurélie Thiele, A Robust Optimization Approach to Supply Chain Management integer programming and combinatorial optimization. pp. 86- 100 ,(2004) , 10.1007/978-3-540-25960-2_7
Andrzej Ruszczyński, Alexander Shapiro, Stochastic Programming Models Handbooks in Operations Research and Management Science. ,vol. 10, pp. 1- 64 ,(2003) , 10.1016/S0927-0507(03)10001-1
Jennie Si, Andrew G Barto, Warren B Powell, Don Wunsch, Handbook of Learning and Approximate Dynamic Programming (2004). ,(2004) , 10.1109/9780470544785
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-de-Mello, The Sample Average Approximation Method for Stochastic Discrete Optimization Siam Journal on Optimization. ,vol. 12, pp. 479- 502 ,(2002) , 10.1137/S1052623499363220
Xiaomei Ding, Martin L. Puterman, Arnab Bisi, The Censored Newsvendor and the Optimal Acquisition of Information Operations Research. ,vol. 50, pp. 517- 527 ,(2002) , 10.1287/OPRE.50.3.517.7752
Paul Glasserman, Sridhar Tayur, Sensitivity Analysis for Base-Stock Levels in Multiechelon Production-Inventory Systems Management Science. ,vol. 41, pp. 263- 281 ,(1995) , 10.1287/MNSC.41.2.263