Volume 16, No 3, 2009, P. 47-62

UDC 004
V. M. Kartak
The grouping method for the linear relaxation of 1d cutting stock problem

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.

Kartak Vadim Mikhailovich 1
1. Ufa State Aviation Technical University,
12 K.Marx str., 450000 Ufa, Russia
e-mail: kvmail@mail.ru

 © Sobolev Institute of Mathematics, 2015