Solving and Interpreting Large-Scale Harvest Scheduling Problems by Duality and Decomposition
Abstract:This paper presents a solution to the timber harvest scheduling problem that takes advantage of both the duality of linear programming formulations currently being used for timber harvest scheduling and the characteristics of decomposition inherent in the model formulation. The subproblems of decomposition, defined as the dual, can be solved in a simple, recursive fashion. In effect, such a technique reduces the computational burden in terms of time and computer storage as compared to the traditional primal solutions. In addition, utilization of this method allows the use of two simple procedures for creating an initial basic feasible solution. Forest management alternatives within one (or more) timber class can be evaluated easily in this framework, and multiple-use considerations can be incorporated directly into the optimization as nonharvest values. Forest Sci. 30:173-182.
Document Type: Journal Article
Affiliations: Assistant Professor of Economics, Oregon State University, Corvallis, OR 97331
Publication date: March 1, 1984
More about this publication?
- Membership Information
- ingentaconnect is not responsible for the content or availability of external websites