Technical Note—Cyclic Dynamic Programming: A Procedure for Problems with Fixed Delay

David G. Luenberger
Additional contact information
David G. Luenberger: Stanford University, Stanford, California

Operations Research, 1971, vol. 19, issue 4, 1101-1110

Abstract: A dynamic decision problem in which the effect of control action is either delayed for a number of time periods or has an effect that lasts for a fixed period leads, in the conventional formulation, to a high-dimensional dynamic-programming problem. This paper develops a method for exploiting the inherent structure of such problems that leads to low-dimensional “cyclic dynamic programming” problems that are easier to solve than the problem that is obtained by the conventional approach.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.4.1101 (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:19:y:1971:i:4:p:1101-1110

Access Statistics for this article

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