Solving and Interpreting Large-scale Harvest Scheduling Problems by Duality and Decomposition

Peter Berck and Thomas Bible

Department of Agricultural & Resource Economics, UC Berkeley, Working Paper Series from Department of Agricultural & Resource Economics, UC Berkeley

Abstract: This paper presents a solution to the forest planning problem that takes advantage of both the duality of linear programming formulations currently being used for harvest scheduling and the characteristics of decomposition inherent in the forest land class-relationship. 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) land class can be evaluated easily in this framework, and multiple-use considerations can be incorporated directly into the optimization as nonharvest values.

Keywords: forestry; land utilization; mathematical models; planning; dualtiy; decomposition; Social and Behavioral Sciences (search for similar items in EconPapers)
Date: 1982-08-01
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.escholarship.org/uc/item/0vj9x9m9.pdf;origin=repeccitec (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:cdl:agrebk:qt0vj9x9m9

Access Statistics for this paper

More papers in Department of Agricultural & Resource Economics, UC Berkeley, Working Paper Series from Department of Agricultural & Resource Economics, UC Berkeley Contact information at EDIRC.
Bibliographic data for series maintained by Lisa Schiff ().