Computing near-optimal policies in generalized joint replenishment

INFORMS Journal on Computing

Volumn 24, Issue 1, 2012, Pages 148-164

  Adelman, Daniel ^a   Klabjan, Diego ^b  

^a UNIVERSITY OF CHICAGO   (United States)

^b Northwestern University   (United States)

Author keywords

Approximate dynamic programming; Generalized joint replenishment; Piecewise linear ridge functions

Indexed keywords

APPROXIMATE DYNAMIC PROGRAMMING; CYCLIC SCHEDULES; JOINT REPLENISHMENT; NEAR-OPTIMAL POLICIES; PIECEWISE-LINEAR; SPECIAL STRUCTURE; VALUE FUNCTION APPROXIMATION;

MATHEMATICAL PROGRAMMING;

PIECEWISE LINEAR TECHNIQUES;

EID: 84862009362     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0433     Document Type: Article

References (16)

1. Adelman, D. 2003. Price-directed replenishment of subsets: Methodology and its application to inventory routing. Manufacturing Service Oper. Management 5 (4) 348-371.
2. Adelman, D. 2004. A price-directed approach to stochastic inventory/routing. Oper. Res. 52 (4) 499-514.
3. Adelman, D., D. Klabjan. 2005. Duality and existence of optimal policies in generalized joint replenishment. Math. Oper. Res. 30 (1) 28-50. (Pubitemid 43126848)
4. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows. Prentice Hall, Englewood Cliffs, NJ.
5. Croxton, K. L., B. Gendron, T. L. Magnanti. 2003. A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Sci. 49 (9) 1268-1273.
6. de Farias, D. P., B. Van Roy. 2003. The linear programming approach to approximate dynamic programming. Oper. Res. 51 (6) 850-865.
7. de Farias, D. P., B. Van Roy. 2004. On constraint sampling in the linear programming approach to approximate dynamic programming. Math. Oper. Res. 29 (3) 462-478.
8. Dror, M. 2005. Routing propane deliveries. A. Langevin, D. Riopel, eds. Logistics Systems: Design and Optimization. Springer, New York, 299-322.
9. Goyal, S. K. 1987. Comment on "]A dynamic programming approach for joint replenishment under general order cost functions." Management Sci. 33 (1) 133-135.
10. Hernández-Lerma, O., J. B. Lasserre. 1996. Discrete-Time Markov Control Processes: Basic Optimality Criteria. Springer-Verlag, Berlin.
11. Klabjan, D., D. Adelman. 2006. Existence of optimal policies for semi-Markov decision processes using duality for infinite linear programming. SIAM J. Control Optim. 44 (6) 2104-4122.
12. Klabjan, D., D. Adelman. 2007. An infinite-dimensional linear programming algorithm for deterministic semi-Markov decision processes on Borel spaces. Math. Oper. Res. 32 (3) 528-550. (Pubitemid 351159467)
13. Powell, W. B. 2007. Approximate Dynamic Programming: Solving the Curses of Dimensionality. John Wiley & Sons, New York.
14. Queyranne, M. 1987. Comment on "]A dynamic programming algorithm for joint replenishment under general order cost functions." Management Sci. 33 (1) 131-133.
15. Rosenblatt, M. J., M. Kaspi. 1985. A dynamic programming algorithm for joint replenishment under general order cost functions. Management Sci. 31 (3) 369-373. (Pubitemid 15476600)
16. Schweitzer, P. J., A. Seidmann. 1985. Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. 110 (2) 568-582.