Linear Programming vs. Binary Search in Periodic Harvest Level Calculation

$29.50 plus tax (Refund Policy)

Buy Article:


Timber management planning by industrial firms and public agencies commonly involves the use of multiple rotation harvest scheduling models. Either a linear programming or a binary search approach is usually taken. Binary search models have the advantage of being able to process large amounts of inventory data and manipulate that data in unique ways, having a low cost per run, and providing comparable ease in finding a feasible solution. Linear programming models have the advantage of being able to consider alternative yield trajectories for the same acres at the same time, portraying unusual yield trajectories, constraining portions of the inventory, and ensuring that a maximum is found. Neither is uniformly superior to the other and which should be used depends on the situation. Forest Sci. 29:569-581.

Keywords: Harvest scheduling; forest management; simulation

Document Type: Journal Article

Affiliations: Associate Professor, Department of Forest Management, Oregon State University

Publication date: September 1, 1983

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



Share Content

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