Fully distribution-free profit maximization: The inventory management case

Mathematics of Operations Research

Volumn 35, Issue 4, 2010, Pages 728-741

  Wagner, Michael R ^a  

^a SAINT MARY'S COLLEGE OF CALIFORNIA   (United States)

Author keywords

Competitive analysis; Distribution free; Inventory theory; Online optimization; Worst case analysis

Indexed keywords

COMPETITIVE ANALYSIS; DISTRIBUTION-FREE; INVENTORY THEORY; ONLINE OPTIMIZATION; WORST-CASE ANALYSIS;

INVENTORY CONTROL; OPTIMIZATION; PROFITABILITY;

PROBABILITY DISTRIBUTIONS;

EID: 78651068562     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1100.0468     Document Type: Article

References (30)

1. Axsäter, S. 2006. Inventory Control. International Series in Operation Research & Management Science. 2nd ed. Springer, Berlin.
2. Ball, M., M. Queyranne. 2009. Toward robust revenue management: Competitive analysis of online booking. Oper. Res. 57(4) 950-963.
3. Ball, M., H. Gao, I. Karaesmen. 2008. Revenue management and competition: Distribution-free methods. Technical report, Robert H. Smith School of Business, University of Maryland, College Park.
4. Ben-Tal, A., B. Golany, A. Nemirovski. 2005. Retailer-supplier flexible commitments contracts: A robust optimization approach. Manufacturing Service Oper. Management 7(3) 248-271.
5. Bertsimas, D., A. Thiele. 2006. A robust optimization approach to inventory theory. Oper. Res. 54(1) 150-168.
6. Borodin, A., R. El-Yaniv. 1998. Online Computation and Competitive Analysis. Cambridge University Press, Oxford, UK.
7. Boyd, S., L. Vandenberghe. 2004. Convex Optimization. Cambridge University Press, Oxford, UK.
8. Buchbinder, N., T. Kimbrelt, R. Levi, K. Makarychev, M. Sviridenko. 2008. Online make-to-order joint replenishment model: Primal dual competitive algorithms. Proc. Nineteenth Annual ACM-SIAM Sympos. Discrete Algorithms, San Francisco, 952-961.
9. Ehrhardt, R. 1979. The power approximation for computing (s, S) inventory policies. Management Sci. 25(8) 777-786.
10. Gallego, G., I. Moon. 1993. The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. 44(8) 825-834.
11. Gao, H., M. Ball, I. Karaesmen. 2008. Distribution-free methods for dynamic booking control. Technical report, Robert H. Smith School of Business, University of Maryland, College Park.
12. Godfrey, G., W. Powell. 2001. An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. 47(8) 1101-1112.
13. Huh, W. T., P. Rusmevichientong. 2009. A nonparametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34(1) 103-123.
14. Huh, W. T., P. Rusmevichientong. 2009. Online sequential optimization with biased gradients: Theory and applications to censored demand. Submitted.
15. Huh, W. T, G. Janakiraman, J. A. Muckstadt, P. Rusmevichientong. 2009. An adaptive algorithm for finding the optimal base-stock policy in lost sales inventory systems with censored demand. Math. Oper. Res 34(2) 397-416.
16. Huh, W. T., R. Levi, P. Rusmevichientong, J. Orlin. 2010. Adaptive data-driven inventory control policies based on Kaplan-Meier estimator for censored demand. Oper. Res. Forthcoming.
17. Karlin, A. R., M. S. Manasse, L. Rudolph, D. D. Sleator. 1988. Competitive snoopy caching. Algorithmica 3(1) 79-119.
18. Lan, Y., M. Ball, I. Karaesmen. 2008. Overbooking and fare-class allocation with limited information. Technical report, Robert H. Smith School of Business, University of Maryland, College Park.
19. Lan, Y., H. Gao, M. Ball, I. Karaesmen. 2008. Revenue management with limited demand information. Management Sci. 54(9) 1594-1609.
20. Levi, R., R. Roundy, D. Shmoys. 2007. Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4) 821-839. (Pubitemid 351159460)
21. Ma, W., G. Chen. 2004. Competitive algorithms for the on-line inventory problem. Proc. Third Internat. Conf. Machine Learn. Cybernetics, Shanghai, China, Vol. 2, 898-903.
22. Moon, I., G. Gallego. 1994. Distribution free procedures for some inventory models. J. Oper. Res. Soc. 45(6) 651-658.
23. Natarajan, K., M. Sim, J. Uichanco. 2008. Asymmetry and ambiguity in newsvendor models. Technical report, National University of Singapore Business School. Submitted.
24. O'Neil, S., A. Chaudhary. 2008. Comparing online learning algorithms to stochastic approaches for the multi-period newsvendor problem. Proc. Tenth Workshop on Algorithm Engrg. Experiment: Workshop on Analytic Algorithmics and Combinatorics. SIAM, Philadelphia, 49-63.
25. Perakis, G., G. Roels. 2008. Regret in the newsvendor model with partial information. Oper. Res. 56(1) 188-203.
26. Scarf, H. 1958. A min-max solution of an inventory problem. K. Arrow, S. Karlin, H. Scarf, eds. Studies in the Mathematical Theory of Inventory and Production. Stanford University Press, Palo Alto, CA, 201-209.
27. See, C., M. Sim. 2010. Robust approximation to multi-period inventory management. Oper. Res. 58(3) 583-594.
28. Sleator, D., R. Tarjan. 1985. Amortized efficiency of list update and paging rules. Comm. ACM 28(2) 202-208.
29. Vairaktarakis, G. 2000. Robust multi-item newsboy models with a budget constraint. Internat. J. Production Econom. 66(3) 213-226.
30. Wagner, M. R. 2009. Inventory management via competitive analysis. Technical report, submitted.