|
|
||||||||
Graduate School of Business, University of Chicago, Chicago, Illinois 60637
We establish a duality theory for a broad class of deterministic inventory control problems on continuous spaces that includes the classical joint replenishment problem and inventory routing. Using this theory, we establish the existence of an optimal policy, which has been an open question. We show how a primal-dual pair of infinite dimensional linear programs encode both cyclic and noncyclic schedules, and provide various results regarding cyclic schedules, including an example showing that they need not be optimal.
Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801
dan.adelman{at}ChicagoGSB.edu
klabjan{at}uiuc.edu
History: Received: November 20, 2003;
revision received: March 26, 2004;
This article has been cited by other articles:
![]() |
D. Klabjan and D. Adelman An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces Mathematics of Operations Research, August 1, 2007; 32(3): 528 - 550. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |