The traditional question of optimally deciding when to cut down a tree is among the most commonly posed questions asked of students learning the technique of dynamic programming. This paper shows that the traditional tree-cutting example is improperly formulated when the question of replanting is addressed, derives the proper method of finding optimal harvest length, and applies this method to an empirical forest growth function.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)