Search Filter
- Publications
- Abstract of Theses and Dissertations
- Database
- Cut Scheduling in Industrial Forest Plantations by Linear Programming
Cut Scheduling in Industrial Forest Plantations by Linear Programming
Thesis Abstract:
The study aimed mainly to develop a functional linear programming model to solve simultaneously the problem of cut scheduling and forest plantation development. The model was applied to a hyphotethical forest, using pertinent data from Nasipit Lumber Company, Inc (NALCO) whose management's objectives is to maximize the net worth of existing and proposed Albizia factar plantations. Based on 46-year planning horizon, the model included 2,325 decision variables and 480 constraining equations. The model was also statistically analyzed for different levels of demand.
Result indicated that a Linear programming model could be developed and utilized to solve problems of forest development and cut schelduling in industrial forest plantations.Such a model could provide optimal answers to questions on what, when and how much to cut and the same time carry on the effective development program whenever forest expansion is needed.It cold also furnish the management with a procurement schedule in case production is insufficient to supplt the demand.
It was also observed in the study that optimal solution was sensitive to changes in demand levels and that the values of avaliable resources were affected not only by the level of demand but also by such other factors as accessibility, site and time of resource availability.