Aggregation in Dynamic Programming

James C. Bean, John Birge and Robert L. Smith
Additional contact information
James C. Bean: University of Michigan, Ann Arbor, Michigan
Robert L. Smith: University of Michigan, Ann Arbor, Michigan

Operations Research, 1987, vol. 35, issue 2, 215-220

Abstract: Reducing the size of a dynamic program through state aggregation can significantly reduce both the data and the computation time required to solve a problem. We develop a new algorithm that combines state aggregation and disaggregation steps within a single-pass procedure. The solution obtained is automatically feasible for the original problem. By exploiting general conditions on the aggregate structure, we develop bounds for assessing the error from optimality introduced by the aggregation, and we illustrate with an application in infinite horizon optimization.

Keywords: 114 state aggregation; 621 aggregation in dynamic programming (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.2.215 (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:35:y:1987:i:2:p:215-220

Access Statistics for this article

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