How to formulate and solve "optimal stand density over time" problems for even-aged stands using dynamic programming.

Chung M. Chen; Dietmar W. Rose; Rolfe A. Leary

doi:10.2737/NC-GTR-56

Treesearch

How to formulate and solve "optimal stand density over time" problems for even-aged stands using dynamic programming.

Informally Refereed

Authors:

Chung M. Chen, Dietmar W. Rose, Rolfe A. Leary

Year:

1980

Type:

General Technical Report

Station:

Northern Research Station

DOI:

https://doi.org/10.2737/NC-GTR-56

Source:

General Technical Report NC-56. St. Paul, MN: U.S. Dept. of Agriculture, Forest Service, North Central Forest Experiment Station

Download (PDF 2.48 MB)

Download (PDF 2.48 MB): https://research.fs.usda.gov/download/treesearch/10121.pdf

Abstract

Describes how dynamic programming can be used to solve optimal stand density problems when yields are given by prior simulation or by a new stand growth equation that is a function of the decision variable. Formulations of the latter type allow use of a calculus-based search procedure; they determine exact optimal residual density at each stage.

Keywords

optimal stand density, dynamic programming, growth models

Citation

Chen, Chung M.; Rose, Dietmar W.; Leary, Rolfe A. 1980. How to formulate and solve "optimal stand density over time" problems for even-aged stands using dynamic programming. General Technical Report NC-56. St. Paul, MN: U.S. Dept. of Agriculture, Forest Service, North Central Forest Experiment Station