An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand
Published Online:17 Apr 2009https://doi.org/10.1287/moor.1080.0367
References
- Estimating negative binomial demand for retail inventory management with unobservable lost sales. Naval Res. Logist. (1996) 43:839–861Crossref, Google Scholar
- Adaptive ordering and pricing for perishable products. Oper. Res. (2000) 48(3):436–443Link, Google Scholar
- Perfect simulation of an inventory model for perishable products. Stochastic Models (2002) 18(2):229–243Crossref, Google Scholar
- Online convex optimization in the bandit setting: Gradient descent without a gradient. Proc. 16th Annual Sympos. Discrete Algorithms (2004) (Association for Computing Machinery-Society for Industrial and Applied Mathematics (ACM-SIAM))385–394Google Scholar
- An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. (2001) 47(8):1101–1112Link, Google Scholar
- Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. (1963) 58:13–30Crossref, Google Scholar
- Online sequential optimization with biased gradients: Theory and applications to censored demand. (2006) . Working paper, Columbia University, New YorkGoogle Scholar
- A non-parametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. (2009) 34(1):103–123Link, Google Scholar
- Asymptotic optimality of order-up-to policies in lost sales inventory systems. Management Sci. (2009) 55(3):404–420Link, Google Scholar
- Lost-sales problems with stochastic lead times: Convexity results for base-stock policies. Oper. Res. (2004) 52(5):795–803Link, Google Scholar
- , Arrow K., Karlin S., Scarf H. Inventory models of the Arrow-Harris-Marschak type with time lag. Studies in the Mathematical Theorey of Inventory and Production (1958) (Stanford University Press, Stanford, CA) Google Scholar
- , Saul L. K., Weiss Y., Bottou L. Nearly tight bounds for the continuum-armed bandit problem. Adv. Neural Inform. Processing Systems (2005) (MIT Press, Cambridge) 697–704Google Scholar
- Provably near-optimal balancing policies for stochastic inventory control models with lost sales. Math. Oper. Res. (2008) 33(2):351–374Link, Google Scholar
- Markov Chains and Stochastic Stability (1993) (Springer-Verlag, New York) Crossref, Google Scholar
- The near-myopic nature of the lagged-proportional-cost inventory problem with lost sales. Oper. Res. (1971) 19(7):1708–1716Link, Google Scholar
- Bounds on the solution of the lagged optimal inventory equation with no demand backlogging and proportional costs. SIAM Rev. (1969) 11(4):572–596Crossref, Google Scholar
- Demand estimation in lost sales inventory systems. Naval Res. Logist. (1994) 41(6):739–757Crossref, Google Scholar
- Learning algorithms for separable approximations of discrete stochastic optimization problems. Math. Oper. Res. (2004) 29(4):814–836Link, Google Scholar
- A new and simple policy for the continuous review lost sales inventory model. (2004) . Working paper, Bell Laboratories, Murray Hill, NJGoogle Scholar
- Online convex programming and generalizaed infinitesimal gradient ascent. Proc. Twentieth Internat. Conf. Machine Learn. (ICML-2003) (2003) Washington, D.C.(Association for the Advancement of Artificial Intelligence (AAAI) Press, Menlo Park, CA) 928–936Google Scholar
- Old and new methods for lost-sales inventory systems. Oper. Res. (2008) 56(5):1256–1263Link, Google Scholar
- On the structure of lost-sales inventory models. Oper. Res. (2008) 56(4):937–944Link, Google Scholar

