Skip to Main content Skip to Navigation
Journal articles

Nerlove-Arrow: A New Solution to an Old Problem

Abstract : We use the optimality principle of dynamic programming to formulate a discrete version of the original Nerlove–Arrow maximization problem. When the payoff function is concave, we give a simple recursive process that yields an explicit solution to the problem. If the time horizon is long enough, there is a “transiently stationary” (turnpike) value for the optimal capital after which the capital must be left to depreciate as it takes the exit ramp. If the time horizon is short, the capital is left to depreciate. Simple closed-form solutions are given for a power payoff function.
Document type :
Journal articles
Complete list of metadatas

https://hal-univ-pau.archives-ouvertes.fr/hal-01881901
Contributor : Gaelle Chancerel-Lannuzel <>
Submitted on : Wednesday, September 26, 2018 - 2:09:38 PM
Last modification on : Wednesday, March 4, 2020 - 1:44:34 AM

Identifiers

Collections

Citation

Marc Artzrouni, Patrice Cassagnard. Nerlove-Arrow: A New Solution to an Old Problem. Journal of Optimization Theory and Applications, Springer Verlag, 2017, 172 (1), pp.267-280. ⟨10.1007/s10957-016-1033-8⟩. ⟨hal-01881901⟩

Share

Metrics

Record views

77