IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v9y1997i3p427-439.html
   My bibliography  Save this article

Complex solutions of nonconcave dynamic optimization models (*)

Author

Listed:
  • Michael Kopel

    (Department of Managerial Economics and Industrial Organization, University of Technology, A-1040 Vienna, AUSTRIA)

  • Gustav Feichtinger

    (Department of Operations Research and Systems Theory, University of Technology, A-1040 Vienna, AUSTRIA)

  • Herbert Dawid

    (Department of Operations Research and Systems Theory, University of Technology, A-1040 Vienna, AUSTRIA)

Abstract

In this paper we consider a class of time discrete intertemporal optimization models in one dimension. We present a technique to construct intertemporal optimization models with nonconcave objective functions, such that the optimal policy function coincides with any pre-specified C2 function. Our result is a variant of the approach presented in a seminal paper by Boldrin and Montrucchio (1986). Whereas they solved the inverse problem for the reduced form models, we address the different question of how to construct both reduced and primitive form models. Using our technique one can guarantee required qualitative properties not only in reduced, but also in primitive form. The fact that our constructed model has a single valued and continuous optimal policy is very important as, in general, nonconcave problems yield set valued optimal policy correspondences which are typically hard to analyze. To illustrate our constructive approach we apply it to a simple nonconcave model.

Suggested Citation

  • Michael Kopel & Gustav Feichtinger & Herbert Dawid, 1997. "Complex solutions of nonconcave dynamic optimization models (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 9(3), pages 427-439.
  • Handle: RePEc:spr:joecth:v:9:y:1997:i:3:p:427-439
    Note: Received: June 15, 1994; revised version February 27, 1996
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Katrin Erdlenbruch & Alain Jean-Marie & Michel Moreaux & Mabel Tidball, 2013. "Optimality of impulse harvesting policies," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 52(2), pages 429-459, March.
    2. Dawid, Herbert & Kopel, Michael, 1997. "On the Economically Optimal Exploitation of a Renewable Resource: The Case of a Convex Environment and a Convex Return Function," Journal of Economic Theory, Elsevier, vol. 76(2), pages 272-297, October.
    3. Mauro Gaggero & Giorgio Gnecco & Marcello Sanguineti, 2013. "Dynamic Programming and Value-Function Approximation in Sequential Decision Problems: Error Analysis and Numerical Results," Journal of Optimization Theory and Applications, Springer, vol. 156(2), pages 380-416, February.
    4. Kopel, Michael & Westerhoff, Frank & Wieland, Cristian, 2008. "Regulating complex dynamics in firms and economic systems," Chaos, Solitons & Fractals, Elsevier, vol. 38(3), pages 911-919.
    5. Herbert Dawid & Engelbert Dockner & Richard Hartl & Josef Haunschmied & Ulrike Leopold-Wildburger & Mikulas Luptacik & Alexander Mehlmann & Alexia Prskawetz & Marion Rauner & Gerhard Sorger & Gernot T, 2010. "Gustav Feichtinger celebrates his 70th birthday," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 18(4), pages 437-451, December.
    6. Kopel, M. & Dawid, H. & Feichtinger, G., 1998. "Periodic and chaotic programs of intertemporal optimization models with non-concave net benefit function," Journal of Economic Behavior & Organization, Elsevier, vol. 33(3-4), pages 435-447, January.

    More about this item

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • O21 - Economic Development, Innovation, Technological Change, and Growth - - Development Planning and Policy - - - Planning Models; Planning Policy

    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:spr:joecth:v:9:y:1997:i:3:p:427-439. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.