Use Dynamic Programming to solve:
DP Formulation:
s.t.
Stage 1:
Stage 2:
Stage 3:
My professor gave us an example problem to work. I have tried it (attached), but I have managed to confuse myself at the end. Will take a look and help me figure out how to finish this problem?