Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand

References

• Bartlett P, Hazan E, Rakhlin A (2008) Adaptive online gradient descent. Platt JC, Koller D, Singer Y, Roweis S, eds. Advances in Neural Information Processing Systems 20 (MIT Press, Cambridge, MA), 65–72.Google Scholar
• Bradley JR, Guerrero HH (2009) Lifetime buy decisions with multiple obsolete parts. Production Oper. Management 18:114–126.Crossref, Google Scholar
• Brumelle SL, McGill JI (1993) Airline seat allocation with multiple nested fare classes. Oper. Res. 41:127–137.Link, Google Scholar
• Burnetas AN, Smith CE (2000) Adaptive ordering and pricing for perishable products. Oper. Res. 48:436–443.Link, Google Scholar
• Chang HS, Fu MC, Hu J, Marcus SI (2005) An adaptive sampling algorithm for solving Markov decision processes. Oper. Res. 53:126–139.Link, Google Scholar
• Chen L, Plambeck E (2008) Dynamic inventory management with learning about demand distribution and substitution probability. Manufacturing Service Oper. Management 10:236–256.Link, Google Scholar
• Flaxman AD, Kalai AT, McMahan HB (2005) Online convex optimization in the bandit setting: Gradient descent without a gradient. Proc. Sixteenth Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 385–394.Google Scholar
• Gallego G, Moon I (1993) The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. 44:825–834.Crossref, Google Scholar
• Godfrey GA, Powell WB (2001) An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. 47:1101–1112.Link, Google Scholar
• Hazan E, Kalai A, Kale S, Agarwal A (2007) Logarithmic regret algorithms for online convex optimization. Machine Learn. 69:169–192.Crossref, Google Scholar
• Huh WT, Rusmevichientong P (2009) A nonparametric approach to stochastic inventory planning with lost sales and censored demand. Math. Oper. Res. 34:103–123.Link, Google Scholar
• Huh WT, Janakiraman G, Muckstadt JA, Rusmevichientong P (2009) An adaptive algorithm for finding the optimal base-stock policy in lost sales inventory systems with censored demand. Math. Oper. Res. 34:397–416.Link, Google Scholar
• Huh WT, Levi R, Rusmevichientong P, Orlin J (2011) Adaptive data-driven inventory control with censored demand based on Kaplan–Meier estimator. Oper. Res. 59:929–941.Link, Google Scholar
• Iglehart DL (1964) The dynamic inventory problem with unknown demand distribution. Management Sci. 10:429–440.Link, Google Scholar
• Iglehart D, Karlin S (1962) Optimal policy for dynamic inventory process with nonstationary stochastic demands. Arrow K, Karlin S, Scarf H, eds. Studies in Applied Probability and Management Science (Stanford University Press, Stanford, CA), 127–147.Google Scholar
• Jagannathan R (1977) Minimax procedure for a class of linear programs under uncertainty. Oper. Res. 25:173–177.Link, Google Scholar
• Karlin S (1960) Dynamic inventory policy with varying stochastic demands. Management Sci. 6:231–258.Link, Google Scholar
• Kunnumkal S, Topaloglu H (2008) Using stochastic approximation methods to compute optimal base-stock levels in inventory control problems. Oper. Res. 56:646–664.Link, Google Scholar
• Levi R, Roundy R, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32:821–838.Link, Google Scholar
• Liyanage LH, Shanthikumar JG (2005) A practical inventory control policy using operational statistics. Oper. Res. Lett. 33:341–348.Crossref, Google Scholar
• Perakis G, Roels G (2008) Regret in the newsvendor model with partial information. Oper. Res. 56:188–203.Link, Google Scholar
• Powell W, Ruszczynski A, Topaloglu H (2004) Learning algorithms for separable approximations of discrete stochastic optimization problems. Math. Oper. Res. 29:814–836.Link, Google Scholar
• Robinson LW (1995) Optimal and approximate control policies for airline booking with sequential nonmonotonic fare classes. Oper. Res. 43:252–263.Link, Google Scholar
• Scarf H (1958) A min–max solution of an inventory problem. Arrow K, Karlin S, Scarf H, eds. Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA), 201–209.Google Scholar
• Scarf H (1960) Some remarks on Bayes solutions to the inventory problem. Naval Res. Logist. Quart. 7:591–596.Crossref, Google Scholar
• Scarf HE (1959) Bayes solution to the statistical inventory problem. Ann. Math. Statist. 30:490–508.Crossref, Google Scholar
• Song J-S, Zipkin P (1993) Inventory control in a fluctuating demand environment. Oper. Res. 41:351–370.Link, Google Scholar
• Tadić VB, Doucet A (2011) Asymptotic bias of stochastic gradient search. 50th IEEE Conf. Decision and Control Eur. Control Conf. (IEEE, Piscataway, NJ), 722–727.Crossref, Google Scholar
• van Ryzin G, McGill J (2000) Revenue management without forecasting or optimization: An adaptive algorithm for determining airline seat protection levels. Management Sci. 46:760–775.Link, Google Scholar
• Veinott AF Jr (1965) Optimal policy for a multi-product, dynamic, nonstationary inventory problem. Management Sci. 12:206–222.Link, Google Scholar
• Zinkevich M (2003) Online convex programming and generalized infinitesimal gradient ascent. Proc. Twentieth Internat. Conf. Machine Learn. (ICML-2003), Washington, DC.Google Scholar
• Zipkin PH (2000) Foundations of Inventory Management (McGraw-Hill/Education, Columbus, OH).Google Scholar