Optimal Discretization of Continuous-Time Control Problems

Nedim M. Alemdar, Fehad Husseinov, Suheyla Ozyildirim

No 1, Computing in Economics and Finance 2001 from Society for Computational Economics

Abstract: Nonlinear infinite horizon continuous time optimization problems are widely used in economics. However numerical solutions necessarily require reformulating the problem into a discrete finite approximation. The method proposed by Mercenier and Michel (1994) minimizes approximation error at steady state but leaves unanswered the question of minimizing approximation errors along the transient path. In this paper, we address that problem as well. That is, with steady state invariance we minimize error at steady state, but by optimally choosing time intervals along the transient path, we find optimal commitment periods which have many business and economics applications. In the paper, the method has been mathematically proved and numerically tested using genetic algorithms.

Keywords: Otimal time aggregation; Genetic algorithms (search for similar items in EconPapers)
JEL-codes: C61 C63 (search for similar items in EconPapers)
Date: 2001-04-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:scecf1:1

Access Statistics for this paper

More papers in Computing in Economics and Finance 2001 from Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F. Baum ().