Nerlove-Arrow: A New Solution to an Old Problem
Résumé
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.