A dynamic programming solution of financial rotation ages for coppicing tree species

The optimal solution to the coppice problem, the problem of when to cut and when to replant a coppice, is shown to satisfy a simple recursive relationship. This recursive relationship is solved using dynamic programming. The approach is illustrated using an example of a eucalyptus plantation.