Computing robust basestock levels

Discrete Optimization

Volumn 5, Issue 2, 2008, Pages 389-414

  Bienstock, Daniel ^a   Özbay, Nuri ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Integer programming; Robust optimization

Indexed keywords

BUFFER STORAGE; INTEGER PROGRAMMING; LEARNING ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; UNCERTAIN SYSTEMS;

BASESTOCK LEVELS; ROBUST BASESTOCK LEVELS; ROBUST FRAMEWORK;

COMPUTATION THEORY;

EID: 41149119059     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.12.002     Document Type: Article

References (30)

1. M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, Z. Liu, Universal stability results for greedy contention-resolution protocols, in: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 380-389
2. A. Atamtürk, M. Zhang, Two-stage robust network flow and design under demand uncertainty, Research Report BCOL.04.03, Department of IEOR, University of California at Berkeley, 2004
3. D. Bienstock, N. Özbay, Computing robust basestock levels-extended version, CORC Report TR-2005-09, Columbia University, 2005
4. Benders J.F. Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik 4 (1962) 238-252
5. Ben-Tal A., Goryashko A., Guslitzer E., and Nemirovski A. Adjusting robust solutions of uncertain linear programs. Mathematical Programming 99 2 (2004) 351-376
6. Ben-Tal A., Golany B., Nemirovski A., and Vial J.-P. Retailer-supplier flexible commitments contracts: A robust optimization approach. MSOM 7 (2005) 248-271
7. Ben-Tal A., and Nemirovski A. Robust convex optimization. Mathematics of Operations Research 23 (1998) 769-805
8. Ben-Tal A., and Nemirovski A. Robust solutions of uncertain linear programs. Operations Research Letters 25 (1999) 1-13
9. Ben-Tal A., and Nemirovski A. Robust solutions of linear programming problems contaminated with uncertain data. Mathematical Programming Series A 88 (2000) 411-424
10. Bertsimas D., and Sim M. Price of robustness. Operations Research 52 (2003) 35-53
11. Bertsimas D., and Thiele A. A robust optimization approach to inventory theory. Operations Research 54 1 (2006) 150-168
12. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, D.P. Williamson, Adversarial queueing theory, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 376-385
13. Clark A., and Scarf H. Optimal policies for a multi-echelon inventory problem. Management Science 6 (1960) 475-490
14. Cruz R.L. A calculus for network delay, part I: Network elements in isolation. IEEE Transactions on Information Theory 37 (1991) 114-131
15. Ehrhart R. (s,S) policies for a dynamic inventory model with stochastic leadtimes. Operations Research 32 (1984) 121-132
16. Federgruen A., and Zipkin P. An efficient algorithm for computing optimal (s,S) policies. Operations Research 32 (1984) 1268-1286
17. Gallego G., Katircioglu K., and Ramachandran B. Inventory management under highly uncertain demand. Operations Research Letters 35 3 (2007) 281-289
18. Gallego G., and Moon I. The distribution free newsboy problem: Review and extensions. Journal of Operations Research Society 44 (1993) 825-834
19. Gallego G., Ryan J., and Simchi-Levi D. Minimax analysis for finite horizon inventory models. IIE Transactions 33 (2001) 861-874
20. Grötschel M., Lovász L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1993), Springer-Verlag
21. D. Iglehart, Dynamic programming and stationary analysis in inventory problems, in: Multistage Inventory Models and Techniques, 1963, Stanford University, Stanford, CA (Chapter 1)
22. Iglehart D. Optimality of (s,S) policies in infinite horizon dynamic inventory problem. Management Science 9 (1963) 259-267
23. Moon I., and Gallego G. Distribution free procedures for some inventory models. Journal of Operations Research Society 45 (1994) 651-658
24. A. Muharremoglu, J. Tsitsiklis, A single unit decomposition approach to multi-echelon inventory systems, Working paper, 2001
25. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1988), Wiley, New York
26. N. Özbay, Robust inventory problems, Ph.D. Thesis, Columbia University, 2006
27. Scarf H. A min-max solution of an inventory problem. Studies in the Mathematical Theory of Inventory and Production (1958), Stanford University Press, Stanford, CA (Chapter 12)
28. A. Thiele, Robust dynamic optimization: A distribution-free approach, 2005 (manuscript)
29. Veinott A. On the optimality of (s, S) inventory policies: New conditions and a new proof. SIAM Journal on Applied Mathematics 14 (1966) 1067-1083
30. Zipkin P. Foundations of Inventory Management (2000), McGraw-Hill Higher Education