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

Published Online:https://doi.org/10.1287/moor.1070.0272

References

  • Ahmed S., Çakmak U., Shapiro A. Coherent risk measures in inventory problems. Eur. J. Oper. Res. (2007) 182:226–238CrossrefGoogle Scholar
  • Azoury K. S. Bayes solution to dynamic inventory models under unknown demand distribution. Management Sci. (1985) 31(9):1150–1160LinkGoogle Scholar
  • Bertsimas D., Thiele A. A robust optimization approach to inventory theory. Oper. Res. (2006) 54(1):150–168LinkGoogle Scholar
  • Bienstock D., Özbay N. Computing robust base-stock levels. (2005) . Technical report CORC Report, TR-2005-09, IEOR Department, Columbia University, New YorkGoogle Scholar
  • Billingsley P.Probability and Measure (1995) 3rd ed.(John Wiley & Sons, New York) Google Scholar
  • Birge J., Wallace S. W. A separable piecewise linear upper bound for stochastic linear programs. SIAM J. Control Optim. (1988) 26:1–14CrossrefGoogle Scholar
  • Bookbinder J. H., Lordahl A. E. Estimation of inventory reorder level using the bootstrap statistical procedure. IEE Trans. (1989) 21:302–312CrossrefGoogle Scholar
  • Burnetas A. N., Smith C. E. Adaptive ordering and pricing for perishable products. Oper. Res. (2000) 48(3):436–443LinkGoogle Scholar
  • Charikar M., Chekuri C., Pál M. Sampling bounds for stochastic optimization. Proc. APPROX-RANDOM 2005 (2005) Berkeley, CA:257–269CrossrefGoogle Scholar
  • Conrad S. A. Sales data and the estimation of demand. Oper. Res. Quart. (1976) 27(1):123–127CrossrefGoogle Scholar
  • Devroye L., Györfi L., Lugosi G.A Probabilistics Theory of Pattern Recognition (1996) (Springer, New York) 196–198Chapter 12CrossrefGoogle Scholar
  • Ding X., Puterman M. L., Bisi A. The censored newsvendor and the optimal acquisition of information. Oper. Res. (2002) 50(3):517–527LinkGoogle Scholar
  • Gallego G., Moon I. A min-max distribution newsboy problem: Review and extensions. J. Oper. Res. Soc. (1993) 44:825–834CrossrefGoogle Scholar
  • Gallego G., Ryan J. K., Simchi-Levi D. Minimax analysis for discrete finite horizon inventory models. IIE Trans. (2001) 33:861–874CrossrefGoogle Scholar
  • Glasserman P., Ho Y. C.Gradient Estimation via Pertubation Analysis (1991) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
  • Glasserman P., Tayur S. Sensitivity analysis for base-stock levels in multiechelon production-inventory systems. Management Sci. (1995) 41:263–282LinkGoogle Scholar
  • Godfrey G. A., Powell W. B. An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. (2001) 47:1101–1112LinkGoogle Scholar
  • Hoeffding W. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. (1963) 58:13–30CrossrefGoogle Scholar
  • Huh W. T., Rusmevichientong P. A non-parametric approach to stochastic inventory planning with lost-sales and censored demand. (2006) . Technical report 1427, School of OR&IE, Cornell University. Submitted to Operations ResearchGoogle Scholar
  • Iglehart D. L. The dynamic inventory problem with unknown demand distribution. Management Sci. (1964) 10(3):429–440LinkGoogle Scholar
  • Iida T., Zipkin P. Approximate solutions of a dynamic forecast-inventory model. Manufacturing Service Oper. Management (2006) 8(4):407–425LinkGoogle Scholar
  • Kapuscinski R., Tayur S. R., Tayur S. R., Ganeshan R., Magazine M. Optimal policies and simulation based optimization for capacitated production inventory systems. Quantitative Models for Supply Chain Management (1998) (Kluwer Academic Publisher, Norwell, MA) . Chapter 2Google Scholar
  • Karlin S. Dynamic inventory policy with varying stochastic demands. Management Sci. (1960) 6(3):231–258LinkGoogle Scholar
  • Kleywegt A. J., Shapiro A., Homem-De-Mello T. The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. (2001) 12:479–502CrossrefGoogle Scholar
  • Lariviere M. A., Porteus E. L. Stalking information: Bayesian inventory management with unobserved lost sales. Management Sci.45(3):346–363LinkGoogle Scholar
  • Liyanage L. H., Shanthikumar J. G. A practical inventory control policy using operational statistics. Oper. Res. Lett. (2005) 33:341–348CrossrefGoogle Scholar
  • Lu X., Song J.-S., Zhu K. Inventory control with unobservable lost sales and Bayesian updates. (2005) . Working paper, Fuqua School of Business, Duke University, Durham, NCGoogle Scholar
  • Lu X., Song J.-S., Zhu K. Analysis of perishable-inventory systems censored demand data. Oper. Res. (2007) . ForthcomingGoogle Scholar
  • Murray G. R., Silver E. A. A Bayesian analysis of the style goods inventory problem. Management Sci. (1966) 12(11):785–797LinkGoogle Scholar
  • Nahmias S. Demand estimation in lost sales inventory systems. Naval Res. Logist. (1994) 41:739–757CrossrefGoogle Scholar
  • Nemirovski A., Shapiro A. On complexity of Shmoys-Swamy class of two-stage linear stochastic programming problems. (2006) . Eprint: www.optimization-online.orgGoogle Scholar
  • Perakis G., Roels G. The distribution-free newsvendor: Inventory management with limited demand information. (2005) . Unpublished manuscriptGoogle Scholar
  • Powell W., Ruszczynski A., Topaloglu H. Learning algorithms for separable approximations of discrete stochastic optimization problems. Math. Oper. Res. (2004) 29(4):814–836LinkGoogle Scholar
  • Rockafellar R. T.Convex Analysis (1972) (Princeton University Press, Princeton, NJ) Google Scholar
  • Ruszczyński A., Shapiro A., Ruszczyński A., Shapiro A. Stochastic programming models. Stochastic Programming, Vol. 10 of Handbooks in Operations Research and Management Science (2003) (Elsevier, Amsterdam, The Netherlands) . Chapter 6CrossrefGoogle Scholar
  • Scarf H., Arrow K. J., Karlin S., Scarf H. A min-max solution to an inventory problem. Studies in the Mathematical Theory of Inventory and Production (1958) (Stanford University Press, Stanford, CA) 201–209Chapter 12Google Scholar
  • Scarf H. Bayes solution to the statistical inventory problem. Ann. Math. Statist. (1959) 30(2):490–508CrossrefGoogle Scholar
  • Scarf H. Some remarks on Bayes solutions to the inventory problem. Naval Res. Logist. Quart. (1960) 7:591–596CrossrefGoogle Scholar
  • Shapiro A., Ruszczyński A., Shapiro A. Monte Carlo sampling methods. Stochastic Programming, Vol. 10 of Handbooks in Operations Research and Management Science (2003) (Elsevier, Amsterdam, The Netherlands) . Chapter 6CrossrefGoogle Scholar
  • Shapiro A. Stochastic programming approach to optimization under uncertainty. Math. Programming (2007) 112:183–220CrossrefGoogle Scholar
  • Shapiro A., Homem-De-Mello T. On the rate of convergence of Monte Carlo approximations of stochastic programs. SIAM J. Optim. (2000) 11:70–86CrossrefGoogle Scholar
  • Shapiro A., Nemirovski A. On the complexity of stochastic programming problems. (2005) . http://www.optimization-online.orgGoogle Scholar
  • Shapiro A., Homem-De-Mello T., Kim J. Conditioning of convex piecewise linear stochastic programs. Math. Programming (2002) 94:1–19CrossrefGoogle Scholar
  • Shorack G., Wellner J. A.Empirical Processes with Applications to Statistics (1986) (Wiley, New York) Google Scholar
  • Si J., Barto A. G., Powell W. B., Wunch D.Handbook of Learning and Approximate Dynamic Programming (2004) (Wiley & Sons, Inc. Publications, New York) CrossrefGoogle Scholar
  • Swamy C., Shmoys D. B. Sampling-based approximation algorithms for multi-stage stochastic optimization. Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (2005) (IEEE Computer Society, Washington, D.C.) CrossrefGoogle Scholar
  • Zipkin P. H.Foundations of Inventory Management (2000) (The McGraw-Hill Companies, Inc., 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.