Optimal growth models with bounded or unbounded returns: A unifying approach. (English) Zbl 1013.91079

The authors propose a unifying approach to the study of the optimal growth models with bounded or unbounded returns. They prove the existence of optimal solutions and show, without using the contraction method, that the value function is the unique solution of the Bellman equation for a particular class of functions. The value function can be obtained by the usual algorithm defined by the operator provided by the Bellman equation.


91B62 Economic growth models
Full Text: DOI Link


[1] Alvarez, F.; Stokey, N., Dynamic programming with homogeneous functions, J. Econ. Theory, 82, 167-189 (1998) · Zbl 0910.90266
[2] Becker, R. A.; Boyd, J. H.; Foias, C., The existence of Ramsey equilibrium, Econometrica, 59, 441-460 (1991) · Zbl 0745.90017
[3] Boyd, J. H., Recursive utility and the Ramsey problem, J. Econ. Theory, 50, 326-345 (1990) · Zbl 0716.90011
[4] Dana, R. A.; Le Van, C., Optimal growth and pareto optimality, J. Math. Econ., 20, 155-180 (1991) · Zbl 0729.90019
[5] Duran, J., On dynamic programming with unbounded returns, Econ. Theory, 15, 339-352 (2000) · Zbl 1101.91339
[6] Stokey, N. L.; Lucas, R. E.; Prescott, E. C., Recursive Methods in Economic Dynamics (1989), Harvard University Press: Harvard University Press Cambridge · Zbl 0774.90018
[7] Streufert, P. A., Stationary recursive utility and dynamic programming under the assumption of biconvergence, Rev. Econ. Stud., 57, 79-97 (1990) · Zbl 0694.90014
[8] Streufert, P. A., An abstract topological approach to dynamic programming, J. Math. Econ., 21, 59-88 (1992) · Zbl 0819.90008
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.