--- Initial Solution Cutting Patterns ---
PATTERN( 1)
Stock Length=6500.00 Qunatity used= 25.0000
Order length=3000.00, Number to cut from each=2, Total cut=50.00
PATTERN( 2)
Stock Length=6500.00 Qunatity used= 12.5000
Order length=2200.00, Number to cut from each=2, Total cut=25.00
PATTERN( 3)
Stock Length=6500.00 Qunatity used= 6.6667
Order length=2000.00, Number to cut from each=3, Total cut=20.00
COST OF USED STOCK = 46375.0000
********** Iteration # 1 ***********
--- BTRAN : Calculate Dual variables (incremental costs) ---
For length 3000.00 Dual cost= 525.00000
For length 2200.00 Dual cost= 525.00000
For length 2000.00 Dual cost= 350.00000
--- DPKNAP : Solve Knapsack Problem ---
Optimal pattern to add
2200.0, 2200.0, 2000.0,
--- DPKNAP : Solve Knapsack Problem ---
Optimal pattern to add
2200.0, 2200.0,
--- ENTCOL : Generate Entering Column ---
2200.0, 2200.0, 2000.0,
Selected source length = 6500.00
Reduced cost = 350.0000
--- FTRAN : Update Column ---
0.0000
1.0000
0.3333
--- CHUZR : Choose pattern to drop {PIVOT ROW} ---
2-th pattern is leaving, at min ratio 12.5000
--- UPBINV: Update B Invers ---
(BI(i,j),i=1,NPART),j=1,NPART (only non-zero displayed)
b(1,1)= 0.5000
b(2,2)= 0.5000
b(3,2)= -0.1667
b(3,3)= 0.3333
--- UPSOL: Update Solution ---
index, basic variable solution
1 25.0000
2 12.5000
3 2.5000
The new cost is = 42000.0000
********** Iteration # 2 ***********
--- BTRAN : Calculate Dual variables (incremental costs) ---
For length 3000.00 Dual cost= 525.00000
For length 2200.00 Dual cost= 350.00000
For length 2000.00 Dual cost= 350.00000
--- DPKNAP : Solve Knapsack Problem ---
Optimal pattern to add
2000.0, 2000.0, 2000.0,
--- DPKNAP : Solve Knapsack Problem ---
Optimal pattern to add
3000.0, 2000.0,
--- ENTCOL : Generate Entering Column ---
Selected source length = 6500.00
Reduced cost = 0.0000
--- Optimal Fractional Solution ---
Pattern(1) Stock length: 6500.00 Needed: 25.00
Order length:3000.00 Number cut from each stock piece: 2
Unused from each stock piece 500.00
Pattern(2) Stock length: 6500.00 Needed: 12.50
Order length:2200.00 Number cut from each stock piece: 2
Order length:2000.00 Number cut from each stock piece: 1
Unused from each stock piece 100.00
Pattern(3) Stock length: 6500.00 Needed: 2.50
Order length:2000.00 Number cut from each stock piece: 3
Unused from each stock piece 500.00
Stock cost = 42000.00
Number of Iterations = 2
--- Optimal Integer Solutuion ---
Pattern(1) Stock length: 6500.00 Needed: 25
Order length:3000.00 Number cut from each stock piece: 2
Unused from each stock piece 500.00
Pattern(2) Stock length: 6500.00 Needed: 13
Order length:2200.00 Number cut from each stock piece: 2
Order length:2000.00 Number cut from each stock piece: 1
Unused from each stock piece 100.00
Pattern(3) Stock length: 6500.00 Needed: 3
Order length:2000.00 Number cut from each stock piece: 3
Unused from each stock piece 500.00
Stock cost = 43050.00