Nerlove-Arrow: A New Solution to an Old Problem - Archive ouverte HAL Access content directly
Journal Articles Journal of Optimization Theory and Applications Year : 2017

Nerlove-Arrow: A New Solution to an Old Problem

(1) , (2)
1
2

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.
Not file

Dates and versions

hal-01881901 , version 1 (26-09-2018)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More