Professional Documents
Culture Documents
Lect12 Cutstock PDF
Lect12 Cutstock PDF
1
The Cutting Stock Problem
The Chase Paper Company makes paper in rolls of
100 inches width, called raws. The company has
a set of orders for rolls of smaller widths, called
finals as follows:
width of final 45 36 31 14
number of orders 97 610 395 211
36 "
31"
31"
2" waste
2
Cutting Patterns
The components of a cutting schedule are the cut-
ting patterns for each of the raws, which are
described by the number of finals of each
width that are cut out of that raw. If we let
aj be the number of finals of width i cut out
of a
a1
a2
particular raw, then a cutting pattern a =
a
3
a4
must satisfy
3
The ILP for the Cutting Stock Problem
min z = x1 + x2 + ... + xr
a11x1 + a12x2 + . . . + a1r xr = 97
a21x1 + a22x2 + . . . + a2r xr = 610
a31x1 + a32x2 + . . . + a3r xr = 395
a41x1 + a42x2 + . . . + a4r xr = 211
x1, x2, . . . , xr 0 integer
4
Starting the Revised Simplex Method
To start the Revised Simplex Method, we need a
starting basis of 4 columns of cutting patterns
which will allow us to satisfy the demand for all
four widths. Our patterns will be the naive ones
that for each final, cuts as many copies of that
final as the 100 inch raw width will allow. This
produces the four columns
2 0 0 0
1
0
2
2
3
0
4
0
a = a =
0
a =
0
a =
3
0
0 0 0 7
basis S/ y rhs
x1 1/2 0 0 0 48 1/2
x2 0 1/2 0 0 305
x3 0 0 1/3 0 131 2/3
x4 0 0 0 1/7 30 1/7
z 1/2 1/2 1/3 1/7 515 13/42
5
Using Delayed Column Generation
The first step of the Revised Simplex Method is
to compute the reduced costs, and to choose the
variable with the most negative reduced cost to
enter the basis. The reduced cost for variable
xi
a1j
j
a 2j
is
associated with cutting pattern a = a
3j
a4j
6
The Auxiliary Knapsack Problem
We do not want to compute all of the cj , just
the one with the most negative value. This is
in turn equivalent to finding the most positive
value of 1/2a
1+ 1/2a2 + 1/3a3 + 1/7a4 ( 1) over
a1
a2
all a = satisfying (). The optimization
a
3
a4
problem is therefore
7
Using the Knapsack Solution
The optimal solution to (K1) is
0
5
2
a =
0
2
with objective function value w = 1 27 . The reduced
cost for the new pattern is
c5 = 11/2(0)1/2(2)1/3(0)1/7(2) = 2/7
so this cutting pattern is eligible to enter the basis.
The entering column associated with x5 is
0 0
2 1
A5 = S
=
0 0
2 2/7
Putting the column in and pivoting on the added
column produces new revised tableau
basis S/ y rhs
x1 1/2 0 0 0 48 1/2
x2 0 1/2 0 1/2 199 1/2
x3 0 0 1/3 0 131 2/3
x5 0 0 0 1/2 105 1/2
z 1/2 1/2 1/3 0 485 1/6
8
We now have new knapsack problem
9
The new knapsack problem is
column a1 a2 a5 a6
number cut 48 12 100 34 105 12 197 21
2 0 0 0
0 2 2 1
pattern
0 0 0 2
0 0 2 0
10
Finding an Integer Solution
The LP solution not implementable, since it is frac-
tional. Our first adjustment is to round down
the LP solution, so that we cut 48 copies of a1, 100
copies of a2, 197 copies of a6, and 105 copies of a5.
This results in total set of finals
2 0 0 0 96
0 2 1 2 607
48 =
+ 100 + 197 + 105
0 0 2 0 394
0 0 0 2 210
This uses 450 raws and leaves 1 final of width 45,
3 finals of width 36, 1 final of width 31, and 1
final of width 14 left unsupplied. A simple inspec-
tion shows that these leftover finals can be cut us-
ing three patterns of (1, 1, 0, 1) and (0, 2, 0, 0), and
(0, 0, 1, 0) for a total of 453 raws to satisfy the given
demands. But since the optimal LP solution has
value 452 41 , this IP solutions must be optimal.
11