Fully Distribution-Free Profit Maximization: The Inventory Management Case

We study profit maximization in inventory control problems where demands are unknown. Neither probabilistic distributions nor sets are available to characterize the unknown demand parameters. Therefore, we adopt an online optimization perspective for our analysis. The usual competitive ratio is not well defined for the problems we analyze; consequently, we introduce a new worst-case metric that is suitable. We consider two inventory management frameworks: (1) perishable products with lost sales and (2) durable products with backlogged demand. We consider both finite and infinite planning horizons. We design best-possible online procurement strategies for all cases.

[1]  Melvyn Sim,et al.  Robust Approximation to Multi-Period Inventory Management ∗ , 2007 .

[2]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[3]  Yingjie Lan,et al.  Overbooking and Fare-Class Allocation with Limited Information , 2007 .

[4]  Niv Buchbinder,et al.  Online make-to-order joint replenishment model: primal dual competitive algorithms , 2008, SODA '08.

[5]  Maurice Queyranne,et al.  Toward Robust Revenue Management: Competitive Analysis of Online Booking , 2009, Oper. Res..

[6]  Retsef Levi,et al.  Adaptive Data-Driven Inventory Control Policies Based on Kaplan-Meier Estimator for Censored Demand , 2010 .

[7]  Georgia Perakis,et al.  Regret in the Newsvendor Model with Partial Information , 2008, Oper. Res..

[8]  Shawn T. O'Neil,et al.  Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem , 2008, ALENEX.

[9]  George L. Vairaktarakis,et al.  Robust multi-item newsboy models with a budget constraint , 2000 .

[10]  Boaz Golany,et al.  Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach , 2005, Manuf. Serv. Oper. Manag..

[11]  G. Gallego,et al.  The Distribution Free Newsboy Problem: Review and Extensions , 1993 .

[12]  R. Ehrhardt.  The Power Approximation for Computing (s, S) Inventory Policies , 1979 .

[13]  David B. Shmoys,et al.  Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models , 2007, Math. Oper. Res..

[14]  Warrren B Powell,et al.  An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution , 2001 .

[15]  Yingjie Lan,et al.  Revenue Management with Limited Demand Information , 2008, Manag. Sci..

[16]  G. Gallego,et al.  Distribution Free Procedures for Some Inventory Models , 1994 .

[17]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[18]  Woonghee Tim Huh,et al.  A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand , 2009, Math. Oper. Res..

[19]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[20]  Dimitris Bertsimas,et al.  A Robust Optimization Approach to Inventory Theory , 2006, Oper. Res..

[21]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[22]  Woonghee Tim Huh,et al.  An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand , 2009, Math. Oper. Res..

[23]  James B. Orlin,et al.  Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator , 2011, Oper. Res..

[24]  Wei-Min Ma,et al.  Competitive algorithms for the on-line inventory problem , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[25]  Melvyn Sim,et al.  Robust Approximation to Multiperiod Inventory Management , 2010, Oper. Res..