Mathematics for Economists

InÖnite dynamic programming

Sometimes the assumption thatris bounded too strong.

Theorem

If V is an optimal solution then it satisÖes the Bellman equation. If V is a

solution of the Bellman equation and for any feasible pathβnV(xn)! 0

then V is the optimal solution.