LINEAR PROGRAMMING CUTTING PROBLEMS

Abstract

Different optimal cutting problems are considered in this paper. Among them are cutting forming problems (closed packing problems) and problems of cutting totality planning with intensities of their application. For solving these planning problems, linear or integer programming is used. Furthermore, different cutting technological and organizational situations are considered. Different optimal criteria and a compromise solution choice procedure are presented. All the statements are illustrated by numerical examples from a guillotine cutting area. The possibility of linear cutting approximation for a non-guillotine (closed packing) cutting stock problem is shown. Rectangular packing algorithms based on this approximation can be built. These algorithms form the basis of special software. Their characteristics are presented in the conclusion of the paper.