Advanced Search
MyIDEAS: Login to save this paper or follow this series

Constructing the Optimal Solutions to the Undiscounted Continuous-Time Infinite Horizon Optimization Problems

Contents:

Author Info

  • Dapeng CAI

    (Institute for Advanced Research, Nagoya University, Nagoya, Japan)

  • Takashi Gyoshin NITTA

    (Department of Mathematics, Faculty of Education, Mie University, Tsu, Japan)

Abstract

We aim to construct the optimal solutions to the undiscounted continuous-time infinite horizon optimization problems, the objective functionals of which may be unbounded. We identify the condition under which the limit of the solutions to the finite horizon problems is optimal for the infinite horizon problems under the overtaking criterion.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://arxiv.org/pdf/0803.4046
File Function: Latest version
Download Restriction: no

Bibliographic Info

Paper provided by arXiv.org in its series Papers with number 0803.4046.

as in new window
Length:
Date of creation: Mar 2008
Date of revision:
Publication status: Published in Nonlinear Analysis: Theory, Methods & Applications, Volume 71, Issue 12, 15 December 2009, Pages e2103-e2108
Handle: RePEc:arx:papers:0803.4046

Contact details of provider:
Web page: http://arxiv.org/

Related research

Keywords:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Cuong Le Van & Lisa Morhaim, 2006. "On optimal growth models when the discount factor is near 1 or equal to 1," International Journal of Economic Theory, The International Society for Economic Theory, vol. 2(1), pages 55-76.
  2. Heal, G., 1998. "Valuing the Future: Economic Theory and Sustainability," Papers 98-10, Columbia - Graduate School of Business.
  3. Kamihigashi, Takashi, 2001. "Necessity of Transversality Conditions for Infinite Horizon Problems," Econometrica, Econometric Society, vol. 69(4), pages 995-1012, July.
  4. Michel, Philippe, 1990. "Some Clarifications on the Transversality Condition," Econometrica, Econometric Society, vol. 58(3), pages 705-23, May.
  5. Weitzman, Martin L., 1998. "Why the Far-Distant Future Should Be Discounted at Its Lowest Possible Rate," Journal of Environmental Economics and Management, Elsevier, vol. 36(3), pages 201-208, November.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:arx:papers:0803.4046. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators).

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.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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