Robust stochastic lot-sizing by means of histograms

Production and Operations Management

Volumn 22, Issue 3, 2013, Pages 691-710

  Klabjan, Diego ^a   Simchi Levi, David ^b   Song, Miao ^c  

^a Northwestern University   (United States)

^b Massachusetts Institute of Technology   (United States)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

dynamic programming; optimal policy; robust optimization; stochastic inventory control

Indexed keywords

EID: 84877826788     PISSN: 10591478     EISSN: 19375956     Source Type: Journal    
DOI: 10.1111/j.1937-5956.2012.01420.x     Document Type: Article

References (33)

1. Ahmed, S., U. Cakmak, A. Shapiro,. 2007. Coherent risk measures in inventory problems. Eur. J. Oper. Res. 182 (1): 226-238.
2. Ben-Tal, A., A. Nemirovski,. 1998. Robust convex optimization. Math. Oper. Res. 23 (4): 769-805.
3. Ben-Tal, A., A. Nemirovski,. 2000. Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88 (3): 411-424.
4. Bertsimas, D., M. Sim,. 2003. Robust discrete optimization and network flows. Math. Program. 98 (1-3): 49-71.
5. Bertsimas, D., M. Sim,. 2004. The price of robustness. Oper. Res. 52 (1): 35-53.
6. Bertsimas, D., A. Thiele,. 2006. A robust optimization approach to inventory theory. Oper. Res. 54 (1): 150-168.
7. Bienstock, D., N. Özbay,. 2008. Computing robust basestock levels. Discrete Optim. 5 (2): 389-414.
8. Billingsley, P., 1986. Probability and Measure, 2nd edn. John Wiley and Sons, New York, NY.
9. Chen, X., D. Simchi-Levi,. 2004. Coordinating inventory control and pricing strategies with random demand and fixed ordering cost: The finite horizon case. Oper. Res. 52 (6): 887-896.
10. Chernoff, H., E. L. Lehmann,. 1954. The use of maximum likelihood estimates in χ 2 tests for goodness-of-fit. Ann. Math. Statist. 25 (3): 579-586.
11. Delage, E., Y. Ye,. 2010. Distributionally robust optimization under moment uncertainty with application to data-driven problem. Oper. Res. 58 (3): 596-612.
12. Gallego, G., I. Moon,. 1993. The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. 44 (8): 825-834.
13. Guan, Y., A. J. Miller,. 2008. Polynomial-time algorithms for stochastic uncapacitated lot-sizing problems. Oper. Res. 56 (5): 1172-1183.
14. Halman, N., D. Klabjan, M. Mostagir, J. Orlin, D. Simchi-Levi,. 2009. A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand. Math. Oper. Res. 34 (3): 674-685.
15. Huh, W. T., P. Rusmevichientong,. 2009. A nonparametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34 (1): 103-123.
16. Iglehart, D. L., 1964. The dynamic inventory problem with unknown demand distribution. Manage. Sci. 10 (3): 429-440.
17. Iyengar, G. N., 2005. Robust dynamic programming. Math. Oper. Res. 30 (2): 257-280.
18. Kouvelis, P., G. Yu,. 1997. Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, Dordrecht, Germany.
19. Law, A. M., W. D. Kelton,. 2000. Simulation Modeling and Analysis, 3rd edn. McGraw-Hill, New York, NY.
20. Liyanage, L. H., J. G. Shanthikumar,. 2005. A practical inventory control policy using operational statistics. Oper. Res. Lett. 33 (4): 341-348.
21. Lobo, M., L. Vandenberghe, S. Boyd, H. Lebret,. 1998. Applications of second-order cone programming. Linear Algebra Appl. 284 (1-3): 193-228.
22. Natarajan, K., M. Sim, J. Uichancoz,. 2008. Asymmetry and ambiguity in newsvendor models. Working paper, National University of Singapore, Singapore.
23. Nilim, A., L. El Ghaoui,. 2005. Robust control of Markov decision processes with uncertain transition matrices. Oper. Res. 53 (5): 780-798.
24. Notzon, E,. 1970. Minimax inventory and queueing models. Technical Report No. 7, Department of Operations Research, Stanford University, Stanford, CA.
25. Perakis, G., G. Roels,. 2008. Regret in the newsvendor model with partial information. Oper. Res. 56 (1): 188-203.
26. Porteus, E. L., 2002. Foundations of Stochastic Inventory Theory. Stanford University Press, Stanford, CA.
27. Royden, H. L,. 1988. Real Analysis, 3rd edn. Prentice Hall, Englewood Cliffs, NJ.
28. Scarf, H,. 1958. A min-max solution of an inventory problem. Studies in the Mathematical Theory of Inventory and Production. Stanford University Press, Stanford, CA.
29. Scarf, H,. 1960. The optimality of (s,S) policies in the dynamic inventory problems. Mathematical Methods in the Social Sciences. Stanford University Press, Stanford, CA.
30. See, C. T., M. Sim,. 2010. Robust approximation to multi-period inventory management. Oper. Res. 58 (3): 583-594.
31. Soyster, A. L,. 1973. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21 (5): 1154-1157.
32. von Neumann, J,. 1928. Zur theorie der gesellschaftsspiele. Math. Ann. 100: 295-320.
33. Zipkin, P., 2000. Foundations of Inventory Management. McGraw-Hill, New York, NY.