The grouping method for the linear relaxation of 1d cutting stock problem

V. M. Kartak

Ufa State Aviation Technical University, Ufa, Russia

Abstract: We consider the problem of large-dimension linear cutting. This problem could be interpreted as a problem of linear integer programming. Using the proposed grouping method we can get the initial solution for the problem of continuous relaxation. This solution is close to the optimum, which often reducing the time to find optimal solutions. Bibl. 15.

Keywords: linear relaxation, simplex-method, 1d cutting stock problem.

UDC: 004

Received: 19.06.2008
Revised: 29.04.2009

Bibliographic databases:

• 
•