A robust optimization approach to inventory theory

Operations Research

Volumn 54, Issue 1, 2006, Pages 150-168

  Bertsimas, Dimitris ^a   Thiele, Aurélie ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Lehigh University   (United States)

Author keywords

Inventory, production: uncertainty; Programming: linear, integer, stochastic

Indexed keywords

INVENTORY, PRODUCTION: UNCERTAINTY; LINEAR PROGRAMMING PROBLEMS; PROGRAMMING: LINEAR, INTEGER, STOCHASTIC;

DYNAMIC PROGRAMMING; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); STOCHASTIC CONTROL SYSTEMS;

INVENTORY CONTROL;

EID: 33644559970     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1050.0238     Document Type: Article

References (24)

1. Ben-Tal, A., A. Nemirovski. 1998. Robust convex optimization. Math. Oper. Res. 23 769-805.
2. Ben-Tal, A., A. Nemirovski. 1999. Robust solutions of uncertain linear programs. Oper. Res. Lett. 25 1-13.
3. Ben-Tal, A., A. Nemirovski. 2000. Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming Ser. A. 88 411-424.
4. Bertsekas, D. 1995. Dynamic Programming and Optimal Contml, Vol. 1. Athena Scientific, Belmont, MA.
5. Bertsekas, D., J. N. Tsitsiklis. 1996. Neuro-Dynamic Programming. Athena Scientific, Belmont, MA.
6. Bertsimas, D., I. Popescu. 2002. On the relation between option and stock prices: A convex optimization approach. Oper. Res. 50 358-374.
7. Bertsimas, D., M. Sim. 2003. Robust discrete optimization and network flows. Math. Programming Ser. B. 98 48-71.
8. Bertsimas, D., M. Sim. 2004. The price of robustness. Oper. Res. 52 35-53.
9. Clark, A., H. Scarf. 1960. Optimal policies for a multi-echelon inventory problem. Management Sci. 6(4) 475-490.
10. El Ghaoui, L., H. Lebret. 1997. Robust solutions to least-square problems to uncertain data matrices. SIAM J. Matrix Anal Appl. 18 1035-1064.
11. El Ghaoui, L., F. Oustry, H. Lebret. 1998. Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9 33-52.
12. Fu, M. C. 1994. Sample path derivatives for (s, S) inventory systems. Oper. Res. 42 351-364.
13. Gallego, G., J. Ryan, D. Simchi-Levi. 2001. Minimax analysis for finite-horizon inventory models. IIE Trans. 33 861-874.
14. Glasserman, P. 1991. Gradient Estimation via Perturbation Analysis. Kluwer Academic Publishers, Boston, MA.
15. Glasserman, P., S. Tayur. 1995. Sensitivity analysis for base stock levels in multi-echelon production-inventory systems. Management Sci. 41 263-281.
16. Ho, Y. C., X. R. Cao. 1991. Discrete Event Dynamic Systems and Perturbation Analysis. Kluwer Academic Publishers, Boston, MA.
17. Kapuscinski, R., S. Tayur. 1999. Optimal policies and simulation based optimization for capacitated production inventory systems. S. Tayur, R. Ganeshan, M. J. Magazine, eds. Chapter 2 in Quantitative Models for Supply Chain Management. Kluwer Academic Publishers, Boston, MA.
18. Kushner, H., D. Clark. 1978. Stochastic Approximation for Constrained and Unconstrained Systems. Springer-Verlag, New York.
19. Lo, A. 1987. Semiparametric upper bounds for option prices and expected payoffs. J. Financial Econom. 19 373-388.
20. Moon, I., G. Gallego. 1993. The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. 44 825-834.
21. Moon, I., G. Gallego. 1994. Distribution free procedures for some inventory models. J. Oper. Res. Soc. 45 651-658.
22. Scarf, H. 1958. A min-max solution of an inventory problem. K. J. Arrow, S. Karlin, H. E. Scarf, eds. Studies in the Mathematical Theory of Inventory and Production. Stanford University Press, Stanford, CA, 201-209.
23. Soyster, A. L. 1973. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21 1154-1157.
24. Zipkin, P. 2000. Foundations of Inventory Management. McGraw-Hill Higher Education, Boston, MA.