Computational Aspects of Dynamic Programming

Stuart E. Dreyfus
Additional contact information
Stuart E. Dreyfus: The Rand Corporation, Santa Monica, California

Operations Research, 1957, vol. 5, issue 3, 409-415

Abstract: Dynamic programming is a method of solving multi-stage decision-process problems. Several computational difficulties are characteristic of all dynamic-programming solutions. This paper will attempt to isolate the most important of these difficulties, to examine present techniques, and to suggest areas in which further developments are required.

Date: 1957
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.5.3.409 (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:5:y:1957:i:3:p:409-415

Access Statistics for this article

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