Dynamic Programming over a Continuous and Disjoint Multidimensional Search Space with an Infinite Time Horizon

Richard E. Hawkins (), Jack Dekkers () and James B. Kleibenstein ()
Additional contact information
Richard E. Hawkins: Iowa State University
Jack Dekkers: Iowa State University
James B. Kleibenstein: Iowa State University

No 811, Computing in Economics and Finance 1999 from Society for Computational Economics

Abstract: Dynamic programming with continuous choice variables generally assumes compact search spaces. Collapsing disjoint n-dimensional bubbles within the space, creating and indexing new bubbles as needed, pushes back the "curse of dimensionality." An animal-breeding optimization is used as an example. The method could solve complex optimal-growth problems.

Date: 1999-03-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:sce:scecf9:811

Access Statistics for this paper

More papers in Computing in Economics and Finance 1999 from Society for Computational Economics CEF99, Boston College, Department of Economics, Chestnut Hill MA 02467 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F. Baum ().