An Interactive Multiple-Objective Linear Programming Approach to a Problem in Forest Management

Ralph E. Steuer and Albert T. Schuler
Additional contact information
Ralph E. Steuer: University of Kentucky, Lexington, Kentucky
Albert T. Schuler: U. S. Department of Agriculture, Princeton, West Virginia

Operations Research, 1978, vol. 26, issue 2, 254-269

Abstract: In many situations it is under legislative mandate to manage publicly owned forest resources for multiple uses (e.g., timber production, hunting, grazing). The major obstacle that has been encountered in applying previously developed mathematical programming procedures to multiple-use forest management has been the difficulty in assessing the appropriate criterion weights required. To avoid the criterion weight estimation problem, an interactive multiple-objective linear programming approach, which does not require criterion weights of any kind, was developed in response to the needs of the multiple-use forest management problem. The procedure uses a combination of linear programming and vector-maximum techniques. At each iteration the cone generated by the gradients of the multiple objectives is contracted. On the last two iterations the most acceptable efficient extreme point is identified with the aid of a filtering device. As illustrated, the method has been applied to prepare preliminary management plans for a 10,000-acre sub-unit of a national forest.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.2.254 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:26:y:1978:i:2:p:254-269

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().