Consider a dynamic programming problem that satisfies all the assumptions of the previous exercise. In addition assume

Question:

Consider a dynamic programming problem that satisfies all the assumptions of the previous exercise. In addition assume that the state space X is a lattice on which
• f (x, y) is supermodular in y
• f (x, y) displays strictly increasing differences in (x, y)
• G(x) is increasing
Show that
1.