September 29, 2021Consider the dynamic programming total harvest maximization problem discussed in Section 2 of the week 2 lecture notes, with precisely the same notation and assumptions. In particular, recall the equations V (x,T −1) = { F(x), if x 6SM x −SM + F(SM ), if x > SM Mathematics by Geoffrey0 comments Q1. Consider the Ricker population model presented in class, Rt+1 = F(Rt) = aRte−bRt, where Rt is the total mass […]