We bring together the theories of duality and dynamic programming. We show that the dual of a separable dynamic optimization problem can be recursively decomposed. We provide a dual version of the principle of optimality and give conditions under which the dual Bellman operator is a contraction...

In this paper a simple dynamic optimization problem is solved with the help of the recursive saddle point method developed by Marcet and Marimon (1999). According to Marcet and Marimon, their technique should yield a full characterization of the set of solutions for this problem. We show though,...