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

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

Author

Listed:
  • Richard E. Hawkins

    (Iowa State University)

  • Jack Dekkers

    (Iowa State University)

  • James B. Kleibenstein

    (Iowa State University)

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.

Suggested Citation

  • Richard E. Hawkins & Jack Dekkers & James B. Kleibenstein, 1999. "Dynamic Programming over a Continuous and Disjoint Multidimensional Search Space with an Infinite Time Horizon," Computing in Economics and Finance 1999 811, Society for Computational Economics.
    • Handle: RePEc:sce:scecf9:811
    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

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