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

1 August 1986

journal article
research article
Published by Canadian Science Publishing in Canadian Journal of Forest Research

Vol. 16 (4) , 799-801
https://doi.org/10.1139/x86-141

Abstract

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.