IDEAS home Printed from https://ideas.repec.org/p/sce/scecf1/1.html
   My bibliography  Save this paper

Optimal Discretization of Continuous-Time Control Problems

Author

Listed:
  • Nedim M. Alemdar, Fehad Husseinov, Suheyla Ozyildirim

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.

Suggested Citation

  • Nedim M. Alemdar, Fehad Husseinov, Suheyla Ozyildirim, 2001. "Optimal Discretization of Continuous-Time Control Problems," Computing in Economics and Finance 2001 1, Society for Computational Economics.
    • Handle: RePEc:sce:scecf1:1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Keywords

    Otimal time aggregation; Genetic algorithms;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sce:scecf1:1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.