1. Two Characterizations of Optimality in Dynamic Programming
- Author
-
Ioannis Karatzas and William D. Sudderth
- Subjects
Mathematical optimization ,Generality ,Control and Optimization ,Transversality ,Applied Mathematics ,Plan (drawing) ,Characterization (mathematics) ,Euler equations ,Computer Science::Robotics ,Dynamic programming ,symbols.namesake ,If and only if ,symbols ,Economic model ,Mathematics - Abstract
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.
- Published
- 2009
- Full Text
- View/download PDF