Infinite-Horizon Dynamic Programming Models—A Planning-Horizon Formulation

Thomas E. Morton
Additional contact information
Thomas E. Morton: Carnegie-Mellon University, Pittsburgh, Pennsylvania

Operations Research, 1979, vol. 27, issue 4, 730-742

Abstract: Two major areas of research in dynamic programming are optimality criteria for infinite-horizon models with divergent total costs and forward algorithm planning-horizon procedures. A fundamental observation for both problems is that the relative cost of two possible initial actions for a given initial state may be quite insensitive to structural information in all but the first few periods of a multiperiod model. Recently Lundin and Morton have developed a unified machinery for the dynamic lot size model that provides a general optimality criterion for the infinite horizon problem and complete planning-horizon procedures. Here those ideas are extended to provide a formal infinite-horizon/planning-horizon framework for a reasonably general form of the dynamic programming problem. Several examples and illustrations are provided. The approach provides a good vehicle for investigating the non-stationary stochastic inventory problem; this work will appear elsewhere.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.4.730 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:4:p:730-742

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().