Two Characterizations of Optimality in Dynamic Programming

It holds in great generality that a plan is optimal for a dynamic programming problem, if and only if it is “thrifty” and “equalizing.” An alternative characterization of an optimal plan, that applies in many economic models, is that the plan must satisfy an appropriate Euler equation and a transversality condition. Here we explore the connections between these two characterizations.