Solution of a Large-Scale Forest Scheduling Problem by Linear Programming Decomposition
Abstract:The linear programming decomposition solution of a large-scale forest scheduling problem involving the cutting of 1166 woodlands over the next 24 years is discussed. The original problem was formulated as a linear programming problem which involved about 28,000 variables and 1200 restraint equations. However, a problem of this size is too large for a computer solution to be achieved by usual linear programming simplex solution methods. The decomposition approach treats a large linear programming problem as a series o! smaller linear programming subproblems whenever the structure of problem permits. Although the decomposition procedure was here terminated after the solution of 930 such subproblems, the gain in yield was extremely small alter 240 iterations such that three hours of IBM 7044 computation would have provided excellent operating results.
Document Type: Journal Article
Affiliations: Industrial Engineering Department of St. Louis University
Publication date: 1967-09-01
More about this publication?
- The Journal of Forestry is the most widely circulated scholarly forestry journal in the world. In print since 1902, the Journal has received several national awards for excellence. The mission of the Journal of Forestry is to advance the profession of forestry by keeping forest management professionals informed about significant developments and ideas in the many facets of forestry: economics, education and communication, entomology and pathology, fire, forest ecology, geospatial technologies, history, international forestry, measurements, policy, recreation, silviculture, social sciences, soils and hydrology, urban and community forestry, utilization and engineering, and wildlife management. The Journal is published bimonthly: January, March, May, July, September, and November.
2015 Impact Factor: 1.476
Ranking: 22 of 66 in forestry
Also published by SAF:
Other SAF Publications
- Submit a Paper
- Membership Information
- Author Guidelines
- Ingenta Connect is not responsible for the content or availability of external websites