On the minimum rate of impatience for complicated optimal growth paths (Q1183701): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-0531(92)90074-r / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2009767790 / rank | |||
Normal rank |
Latest revision as of 09:08, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the minimum rate of impatience for complicated optimal growth paths |
scientific article |
Statements
On the minimum rate of impatience for complicated optimal growth paths (English)
0 references
28 June 1992
0 references
The paper deals with a class of discounted optimal growth models in reduced form. A new type of necessary optimality condition is developed: If the growth path \(x\) is optimal in any standard optimal growth problem with discount rate \(\rho\), then there is no representation of the initial state \(x_ 0\) as a weighted average of all future capital stocks along this path with the weights decreasing at a rate greater than or equal to \(\rho\). This condition can be used to derive a lower bound on the rate of impatience under which a given path can be optimal. Both the discrete time case and the continuous case are treated.
0 references
discounted optimal growth
0 references
necessary optimality condition
0 references
discrete time case
0 references
continuous case
0 references
0 references