Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution

References

• Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Machine Learn. 47(2):235–256.Crossref, Google Scholar
• Besbes O, Muharremoglu A (2013) on implications of demand censoring in the newsvendor problem. Management Sci. 59(6):1407–1424.Link, Google Scholar
• Besbes O, Zeevi A (2009) Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Oper. Res. 57(6):1407–1420.Link, Google Scholar
• Besbes O, Zeevi A (2015) On the (surprising) sufficiency of linear models for dynamic pricing with demand learning. Management Sci. 61(4):723–739.Link, Google Scholar
• Burnetas AN, Smith CE (2000) Adaptive ordering and pricing for perishable products. Oper. Res. 48(3):436–443.Link, Google Scholar
• Chen B (2021) Data-driven inventory control with shifting demand. Production Oper. Management 30(5):1365–1385.Crossref, Google Scholar
• Chen B, Chao X, Ahn H-S (2019) Coordinating pricing and inventory replenishment with nonparametric demand learning. Oper. Res. 67(4):1035–1052.Abstract, Google Scholar
• Chen B, Chao X, Shi C (2021) Nonparametric algorithms for joint pricing and inventory control with lost-sales and censored demand. Math. Oper. Res. 46(2):726–756.Link, Google Scholar
• Cooper W, Rangarajan B (2012) Performance guarantees for empirical Markov decision processes with applications to multiperiod inventory models. Oper. Res. 60(5):1267–1281.Link, Google Scholar
• Ehrhardt R (1979) The power approximation for computing (s, S) inventory policies. Management Sci. 25(8):777–786.Link, Google Scholar
• Federgruen A, Zipkin P (1984) An efficient algorithm for computing (s, S) policies. Oper. Res. 32(6):1268–1285.Link, Google Scholar
• Feng Y, Xiao B (2000) A new algorithm for computing optimal (s, S) policies in a stochastic single item/location inventory system. IIE Trans. 32(11):1081–1090.Crossref, Google Scholar
• Freeland JR, Porteus EL (1980) Evaluating the effectiveness of a new method for computing approximately optimal (s, S) inventory policies. Oper. Res. 28(2):353–364.Link, Google Scholar
• Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58(301):13–30.Crossref, Google Scholar
• Huh WT, Rusmevichientong P (2009) A non-parametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34(1):103–123.Link, Google Scholar
• Huh WT, Levi R, Rusmevichientong P, Orlin JB (2011) Adaptive data-driven inventory control with censored demand based on Kaplan-Meier estimator. Oper. Res. 59(4):929–941.Link, Google Scholar
• Iglehart DL (1963) Dynamic programming and stationary analysis of inventory problems. Scarf H, Gilford D, Shelly M, eds. Multistage Inventory Models and Techniques (Stanford University Press, Stanford, CA), 259–267.Google Scholar
• Katehakis MN, Yang J, Zhou T (2020) Dynamic inventory and price controls involving unknown demand on discrete nonperishable items. Oper. Res. 68(5):1335–1355.Link, Google Scholar
• Keskin NB, Zeevi A (2017) Chasing demand: Learning and earning in a changing environment. Math. Oper. Res. 42(2):277–307.Link, Google Scholar
• Kiefer J, Wolfowitz J (1952) Stochastic estimation of the maximum of a regression function. Ann. Math. Statist. 23(3):462–466.Crossref, Google Scholar
• Lai TL, Robbins H (1985) Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1):4–22.Crossref, Google Scholar
• Levi R, Roundy RO, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4):821–839.Link, Google Scholar
• Robbins H (1952) Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc. 58(5):527–535.Crossref, Google Scholar
• Robbins H, Monro S (1951) A stochastic approximation method. Ann. Math. Statist. 22(3):400–407.Crossref, Google Scholar
• Savage IR (1961) Probability inequalities of the Tchebycheff type. Math. Math. Phys. B 65(3):211–222.Google Scholar
• Scarf H (1960) The optimality of (S, s) policies in the dynamic inventory problem. Arrow KJ, Karlin S, Suppes P, eds. Mathematical Models in the Social Sciences (Stanford University Press, Stanford, CA), 196–202.Google Scholar
• Tsybakov A (2008) Introduction to Nonparametric Estimation (Springer Science & Business Media, Berlin).Google Scholar
• Veinott AF (1966) On the optimality of (s, S) inventory policies: New conditions and a new proof. SIAM J. Appl. Math. 14(5):1067–1083.Crossref, Google Scholar
• Veinott AF, Wagner HM (1965) Computing optimal (S, s) inventory policies. Management Sci. 11(5):525–552.Link, Google Scholar
• Wang Z, Deng S, Ye Y (2014) Close the gaps: A learning-while-doing algorithm for single-product revenue management problems. Oper. Res. 62(2):318–331.Link, Google Scholar
• Yuan H, Luo Q, Shi C (2021) Marrying stochastic gradient descent with bandits: Learning algorithms for inventory systems with fixed costs. Management Sci. 67(10):6089–6115.Link, Google Scholar
• Zabel E (1962) A note on the optimality of (S, s) policies in inventory theory. Management Sci. 9(1):123–125.Link, Google Scholar
• Zheng Y-S (1991) A simple proof for optimality of (s, S) policies in infinite-horizon inventory systems. J. Appl. Probability 28(4):802–810.Crossref, Google Scholar
• Zheng Y-S, Federgruen A (1991) Finding optimal (s, S) policies is about as simple as evaluating a single policy. Oper. Res. 39(4):654–665.Link, Google Scholar