Duality and existence of optimal policies in generalized joint replenishment

Mathematics of Operations Research

Volumn 30, Issue 1, 2005, Pages 28-50

  Adelman, Daniel ^a   Klabjan, Diego ^b  

^a UNIVERSITY OF CHICAGO   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Cyclic schedule; Deterministic inventory theory; Existence of optimal policies; Infinite linear programming duality; Semi Markov decision process

Indexed keywords

CYCLIC SCHEDULE; DETERMINISTIC INVENTORY THEORY; EXISTENCE OF OPTIMAL POLICIES;

INVENTORY CONTROL; LINEAR PROGRAMMING; MARKOV PROCESSES; PROBLEM SOLVING;

OPERATIONS RESEARCH;

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

References (22)

1. Adelman, D. 2003. Rice-directed replenishment of subsets: Methodology and its application to inventory routing. Manufacturing Service Oper. Management 5(4) 348-371.
2. Anderson, E., P. Nash. 1987. Linear Programming in Infinite-Dimensional Spaces. John Wiley and Sons, New York.
3. Anily, S., A. Federgruen. 1990. One warehouse multiple retailer systems with vehicle routing costs. Management Sci. 36 92-114.
4. Bramel, J., D. Simchi-Levi. 1995. A location based heuristic for general routing problems. Oper. Res. 43 649-660.
5. Chan, L. M., A. Federgruen, D. Simchi-Levi. 1998. Probabilistic analyses and practical algorithms for inventory routing models. Oper. Res. 46 96-106.
6. Federgruen, A., Y. S. Zheng. 1992. The joint replenishment problem with general joint cost structures. Oper. Res. 40 384-403.
7. Fox, B. 1966. Markov renewal programming by linear fractional programming. SIAM J. Appl. Math. 14 1418-1432.
8. Goyal, S. K., A. T. Satir. 1989. Joint replenishment inventory control: Deterministic and stochastic models. Eur. J. Oper. Res. 38 2-13.
9. Harris, F. 1915. Operations and Cost (Factory Management Series). A. W. Shaw Co., Chicago, IL.
10. Hassin, R., N. Megiddo. 1991. Exact computation of optimal inventory policies over an unbounded horizon. Math. Oper. Res. 16 534-546.
11. Hernández-Lerma, O., J. Lasserre. 1996. Discrete-Time Markov Control Processes: Basic Optimality Criteria. Springer-Verlag, New York.
12. Hernández-Lerma, O., J. Lasserre. 1999. Further Topics on Discrete-Time Markov Control Processes. Springer-Verlag, New York.
13. Klabjan, D., D. Adelman. 2003. Existence of optimal policies for semi-Markov decision processes using duality for infinite linear programming. Working paper, Graduate School of Business, University of Chicago, Chicago, IL.
14. Naddor, E., S. Saltzman. 1958. Optimal reorder periods for an inventory system with variable costs of ordering. Oper. Res. 6 676-685.
15. Queyranne, M. 1987. Comment on "A dynamic programming algorithm for joint replenishment under general order cost functions." Management Sci. 33 131-133.
16. Rieder, U. 1978. Measurable selection theorems for optimization problems. Manuscripta Math. 24 115-131.
17. Rosenblatt, M. J., M. Kaspi. 1985. A dynamic programming algorithm for joint replenishment under general order cost functions. Management Sci. 31 369-373.
18. Roundy, R. 1985. 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems. Management Sci. 31 1416-1430.
19. Roundy, R. 1986. A 98%-effective lot-sizing rule for a multi-product, multi-stage production/inventory system. Math. Oper. Res. 11 699-727.
20. Schwarz, L. B. 1973. A simple continuous review deterministic one-warehouse N-retailer inventory problem. Management Sci. 19 555-566.
21. Sun, D. 2004. Existence and properties of optimal production and inventory policies. Math. Oper. Res. 29(4) 923-934.
22. Zipkin, P. 2000. Foundations of Inventory Management. McGraw-Hill, New York.