A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production.

Autor: Haberl, J., Nowak, Chr, Stettner, H., Stoiser, G., Woschitz, H.
Zdroj: ZOR: Mathematical Methods of Operations Research; Mar1991, Vol. 35 Issue 2, p151-166, 16p
Abstrakt: This paper deals with the problem of profit optimization in sawn timber production, utilizing a special type of sawmill. Expected rejects and resetting costs are taken into consideration. The present problem is formulated as a fixed charge linear programming problem involving identical fixed charges, one equality constraint and explicit bounds on the variables. Based on the greedy sorting of the variables we develop a branch-and-bound algorithm working on a special subset of all solutions. Through usage of the problem structure for constructing bounds we arrive at an acceptable CPU-time (on a 80386 personal computer) for practical purposes. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz: