LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Nerlove–Arrow: A New Solution to an Old Problem

Photo from wikipedia

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… Click to show full 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.

Keywords: nerlove arrow; solution old; new solution; arrow new; problem

Journal Title: Journal of Optimization Theory and Applications
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.