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

1986 ◽  
Vol 16 (4) ◽  
pp. 799-801 ◽  
Author(s):  
David E. Tait
Keyword(s):  
Dynamic Programming ◽  
Tree Species ◽  
Optimal Solution ◽  
Eucalyptus Plantation ◽  
Programming Solution ◽  
Dynamic Programming Solution

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.

scholarly journals Optimal Exploitation of Multiple Stocks by a Common Fishery: A New Methodology

1976 ◽  
Vol 33 (1) ◽  
pp. 1-5 ◽  
Author(s):  
R. Hilborn
Keyword(s):  
Dynamic Programming ◽  
Stochastic Dynamic Programming ◽  
Stochastic Dynamic ◽  
Recruitment Curve ◽  
Optimal Exploitation ◽  
Optimal Harvest ◽  
Stock Recruitment ◽  
Programming Solution ◽  
Parameter Values ◽  
Dynamic Programming Solution

Optimal harvest rates for mixed stocks of fish are calculated using stochastic dynamic programming. This technique is shown to be superior to the best methods currently described in the literature. The Ricker stock recruitment curve is assumed for two stocks harvested by the same fishery. The optimal harvest rates are calculated as a function of the size of each stock, for a series of possible parameter values. The dynamic programming solution is similar to the fixed escapement policy only when the two stocks have similar Ricker parameters, or when the two stocks are of equal size. Normally, one should harvest harder than calculated from fixed escapement analysis.

Sign in / Sign up

Export Citation Format

Share Document