1990
DOI: 10.1139/x90-003
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing any-aged management of mixed-species stands. I. Performance of a coordinate-search process

Abstract: Optimal any-aged management problems for mixed-species stands have been solved for the first time. Problem formulation calls for periodic planting and harvesting controls to be applied without constraints on the stand age or size structure over time; classical definitions of both even- and uneven-aged management are, thus, subsets of this general any-aged management definition. The solution technique is a derivative-free, coordinate-search process called the method of Hooke and Jeeves. The optimizer incorporat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
107
3

Year Published

1991
1991
2018
2018

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 103 publications
(112 citation statements)
references
References 0 publications
2
107
3
Order By: Relevance
“…This algorithm has been commonly used for optimising the management of both even-aged stands [14,16,21,26,27,30] and uneven-aged stands [3,11,21]. The direct search method algorithm operates using two search modes: exploratory search and pattern search.…”
Section: Optimisation Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…This algorithm has been commonly used for optimising the management of both even-aged stands [14,16,21,26,27,30] and uneven-aged stands [3,11,21]. The direct search method algorithm operates using two search modes: exploratory search and pattern search.…”
Section: Optimisation Methodsmentioning
confidence: 99%
“…Determination of the optimum combination of many variables needs a set of models and a simulator able to predict the stand development under any set of management parameters. Seeking for the best set of management parameters can be automated by using optimisation [1,5,9,11,14,17,27,31].…”
Section: Introductionmentioning
confidence: 99%
“…This technique is very popular because it is easy to use and can perform well with discreteness of growth models on the expected concavity of the response surface. The Hooke and Jeeves method is described as a Bdirect search method^, which involves a sequential examination of the changes that occur when a problem is solved and the results are compared to the Bbest^solution among the derived [25][26][27][28][29][30][31][32][33]. Generally, the Hooke-Jeeves algorithm consists of two major phases: an Bexploratory search^around the base point and a Bpattern search^in a direction selected for optimization (minimization or maximization) [16].…”
Section: Non-linear Programming (Nlp) Approachmentioning
confidence: 99%
“…A recent development in deterministic stand level optimization studies is the use of nonlinear programming and the stand management control variables (Roise 1986b, Bare and Qalach 1987, Haight and Monserud 1990a, Haight and Monserud 1990b, Valsta 1990, Yoshimoto, et al 1990). This nonlinear programming problem can be stated as where g(u) is the objective function generated by the stand simulator, u is the vector of control variables, xo is some initial condition for the stand simulator, and C is the set of feasible solutions.…”
Section: Iution Using Scementioning
confidence: 99%