Skip to main content

Design of Successive Forest Inventories: Optimization by Convex Mathematical Programing

Buy Article:

$29.50 plus tax (Refund Policy)


Convex mathematical programing is proposed as a method of optimally allocating forest inventory sampling resources under different sampling plans to meet specified precision requirements on several variables. Results of a sensitivity analysis under sampling with partial replacement shows the response of the solution to changing inputs when each restriction becomes limiting. The solutions illustrate that the optimum replacement fraction can vary from complete remeasurement to large replacement fractions depending upon the specified precision levels, the population parameters, and the relative costs of obtaining information. Forest Sci. 20:117-127.

Keywords: Forest surveys; forest sampling designs; inventory planning

Document Type: Journal Article

Affiliations: Assistant Professor, Department of Forestry, Iowa State University, Portland, Oregon

Publication date: June 1, 1974

More about this publication?
  • Membership Information
  • ingentaconnect is not responsible for the content or availability of external websites

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more