A New Decomposition Procedure for Dynamic Programming

Peter J. Wong
Additional contact information
Peter J. Wong: Stanford Research Institute Menlo park, California

Operations Research, 1970, vol. 18, issue 1, 119-131

Abstract: This paper presents a new decomposition procedure that reduces the highspeed memory requirement and interpolations, associated with the dynamic programming algorithm. It shows that an n th-order system described by k coupled difference or differential equations can be treated as a k th-order system with respect to the high-speed memory requirement and interpolations in the dynamic programming procedure.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.1.119 (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:18:y:1970:i:1:p:119-131

Access Statistics for this article

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