Dynamic Programming

Ronald A. Howard
Additional contact information
Ronald A. Howard: Stanford University

Management Science, 1966, vol. 12, issue 5, 317-348

Abstract: Dynamic programming is a mathematical technique for solving certain types of sequential decision problems. We characterize a sequential decision problem as a problem in which a sequence of decisions must be made with each decision affecting future decisions. We need to consider such problems because we rarely encounter an operational situation where the implications of any decision do not extend far into the future. For example, the best way to invest funds this year depends upon how the proceeds from this year's investments can be employed next year. The maintenance policy we should use for our machinery this year depends upon what we intend to do with this machinery in the future. The examples are as numerous as the fields of man's endeavor.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.12.5.317 (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:1966:i:5:p:317-348

Access Statistics for this article

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