Dynamic Programming and Systems of Uncertain Duration

D. J. White
Additional contact information
D. J. White: University of Strathclyde, Glasgow

Management Science, 1965, vol. 12, issue 1, 37-67

Abstract: This paper deals with the application of dynamic programming to systems whose duration is uncertain, and which duration may or may not be a function of the decisionmaker's policy. It extends some of Bellman's work in that the transformed states at successive stages may not have the properties demanded by Bellman; e.g., the state norm need not diminish at all, and can, in fact, increase. The paper deals primarily with computational considerations since, in general, analytic solutions to functional equations are not forthcoming. Both discrete and continuous formulations are considered, the appropriate one to choose depending on the number of states one wishes to cater for, the continuous formulation having certain advantages which the discrete case does not have when a very large number of states are to be differentiated.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.12.1.37 (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:12:y:1965:i:1:p:37-67

Access Statistics for this article

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