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

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.

MoreLess

Year of publication:	1999-03-01
Authors:	Hawkins, Richard E. ; Dekkers, Jack ; Kleibenstein, James B.
Institutions:	Society for Computational Economics - SCE

More details

Series:	Computing in Economics and Finance 1999.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series Computing in Economics and Finance '99 Number 811
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005345543