The Nonstationary Infinite Horizon Inventory Problem
Thomas E. Morton
Additional contact information
Thomas E. Morton: Carnegie-Mellon University
Management Science, 1978, vol. 24, issue 14, 1474-1482
Abstract:
By allowing disposal in each period, a sequence of upper and lower bounds on the infinite horizon nonstationary periodic review inventory problem is obtained. The nth bounds depend only on knowledge of the demand distributions in the first n periods, giving planning horizon results. In general, calculation of any bound requires solution of an ordinary n period problem, although for the proportional cost case the solution for n = 1 and good approximations for n = 2 may easily be given. The upper and lower relative cost and policy bounds are monotonic in the horizon length and, under mild conditions, converge to a unique infinite horizon solution. An analytic expression is given for the asymptotic convergence rate, which is geometric even for the undiscounted case. The formulation given here is a concrete example of the general planning horizon formulation for infinite horizon dynamic programming models set forth in [Morton, T. 1975. Infinite horizon dynamic programming models--a planning horizon formulation. Carnegie-Mellon University Management Sciences Research Report No. 372, August (to appear in Operations Res.)].
Keywords: inventory; policy bounds; infinite horizon (search for similar items in EconPapers)
Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (16)
Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.14.1474 (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:ormnsc:v:24:y:1978:i:14:p:1474-1482
Access Statistics for this article
More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().