Nearest Feasible Paths in Optimal Control Problems : Theory, Examples, and Counterexamples

Many infinite-horizon optimal control problems in management science and economics have optimal paths that approach some stationary level. Often, this path has the property of being the nearest feasible path to the stationary equilibrium. This paper obtains a simple multiplicative characterization for a single-state single-control problem to have this property. By using Green's theorem it is shown that the property is observed as long as the stationary level is sustainable by a feasible control. If not, the property is, in general, shown to be false. The paper concludes with an important theorem which states that even in the case of multiple equilibria, the optimal path is a nearest feasible path to one of them