Author： Sherali Hanif D. Liu Chiun-Ming
Publisher： Society of American Foresters
ISSN： 0015-749X
Source： Forest Science, Vol.36, Iss.3, 1990-09, pp. : 599-613
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Berck and Bible (1984) have suggested a solution approach for harvest scheduling problems based on the Dantzig-Wolfe (1960) decomposition algorithm. We first expose the fact that the area constraints in their problem possess a network structure, requiring the solution of a single longest path problem, and show that the elegant dosed-form solution derived by Berck and Bible is precisely a readily obtained longest path solution. Moreover, we show that when additional variable bounds are imposed, the network structure remains exploitable. Second, we compare the computational effort and storage requirements of the Dantzig-Wolfe algorithm and the revised simplex method for solving this problem. The slow tail-end convergence of the Dantzig-Wolfe approach is of particular concern. However, we provide operational guidelines showing when this procedure may be preferred. Other viable algorithms suitable for solving this problem are also discussed. For. Sci. 36(3):599-613.
Related content
Access to resources
Recommend
