--- Job stein45 Start 08/21/08 14:44:57 GAMS Rev 227 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- stein45.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/stein45.gdx --- stein45.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.007 --- stein45.gms(123) 4 Mb --- Generating MIP model m --- stein45.gms(124) 4 Mb --- 332 rows 46 columns 1,080 non-zeroes --- 45 discrete-columns --- stein45.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.013 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 45 columns and 331 rows. 45 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.00.00, build Mar 20 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 22 - 0.00 seconds processed model has 331 rows, 45 columns (45 integer) and 1034 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 12.00000 --> up = 0 , down = 0 -- rand = 26 ( 26) - solution found of 36 Before mini branch and bound, 7 integers at bound fixed and 0 continuous Full problem 331 rows 45 columns, reduced to 199 rows 38 columns Mini branch and bound improved solution from 36 to 31 (0.29 seconds) Round again with cutoff of 30.1 Pass 2: obj. 12.00000 --> up = 0 , down = 0 -- rand = 26 ( 26) Pass 3: obj. 6.05484 --> up = 0 , down = 11 Pass 4: obj. 5.90000 --> up = 2 , down = 0 Pass 5: obj. 4.40000 --> up = 1 , down = 0 Pass 6: obj. 3.90000 --> up = 0 , down = 0 -- rand = 11 ( 26) Pass 7: obj. 4.53333 --> up = 1 , down = 1 Pass 8: obj. 3.31250 --> up = 0 , down = 0 -- rand = 11 ( 11) Pass 9: obj. 7.90000 --> up = 5 , down = 2 Pass 10: obj. 3.28298 --> up = 2 , down = 0 Pass 11: obj. 1.43617 --> up = 0 , down = 0 -- rand = 23 ( 23) Pass 12: obj. 14.00000 --> up = 0 , down = 0 -- rand = 12 ( 12) Pass 13: obj. 8.33333 --> up = 0 , down = 0 -- rand = 23 ( 23) Pass 14: obj. 12.90000 --> up = 0 , down = 15 Pass 15: obj. 5.90000 --> up = 2 , down = 0 Pass 16: obj. 4.59487 --> up = 1 , down = 0 Pass 17: obj. 4.25625 --> up = 0 , down = 3 Pass 18: obj. 4.18800 --> up = 1 , down = 0 Pass 19: obj. 4.18800 --> up = 0 , down = 1 perturbation applied Pass 20: obj. 8.56667 --> up = 4 , down = 1 Pass 21: obj. 5.90000 --> No solution found this major pass Before mini branch and bound, 0 integers at bound fixed and 0 continuous Full problem 331 rows 45 columns, reduced to 331 rows 45 columns - too large Mini branch and bound did not improve solution (0.33 seconds) After 0.33 seconds - Feasibility pump exiting - took 0.33 seconds Integer solution of 31 found by feasibility pump after 0 iterations and 0 nodes (0.33 seconds) 13 added rows had average density of 38.9231 At root node, 13 cuts changed objective from 22 to 22 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.180 seconds - new frequency is 10 Cut generator 1 (Gomory) - 3783 row cuts (13 active), 0 column cuts in 0.092 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.036 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 236 row cuts (0 active), 0 column cuts in 0.080 seconds - new frequency is -100 After 0 nodes, 1 on tree, 31 best solution, best possible 22 (2.07 seconds) Integer solution of 30 found by rounding after 9860 iterations and 98 nodes (4.33 seconds) Full problem 331 rows 45 columns, reduced to 309 rows 42 columns - too large After 1000 nodes, 42 on tree, 30 best solution, best possible 22 (11.27 seconds) After 2000 nodes, 30 on tree, 30 best solution, best possible 22.75 (18.65 seconds) After 3000 nodes, 23 on tree, 30 best solution, best possible 22.75 (25.53 seconds) After 4000 nodes, 19 on tree, 30 best solution, best possible 22.75 (32.06 seconds) After 5000 nodes, 20 on tree, 30 best solution, best possible 22.75 (38.23 seconds) After 6000 nodes, 12 on tree, 30 best solution, best possible 22.75 (44.23 seconds) After 7000 nodes, 16 on tree, 30 best solution, best possible 22.75 (50.43 seconds) After 8000 nodes, 10 on tree, 30 best solution, best possible 22.75 (54.84 seconds) After 9000 nodes, 12 on tree, 30 best solution, best possible 22.75 (58.91 seconds) After 10000 nodes, 14 on tree, 30 best solution, best possible 22.75 (61.16 seconds) After 11000 nodes, 6 on tree, 30 best solution, best possible 22.75 (62.20 seconds) After 12000 nodes, 407 on tree, 30 best solution, best possible 28.5 (63.66 seconds) After 13000 nodes, 267 on tree, 30 best solution, best possible 29 (64.40 seconds) Search completed - best objective 30, took 144504 iterations and 13302 nodes (64.56 seconds) Strong branching done 96174 times (988017 iterations), fathomed 4297 nodes and fixed 1080 variables Maximum depth 20, 27 variables fixed on reduced cost Cuts at root node changed objective from 22 to 22 Probing was tried 1200 times and created 4540 cuts of which 1813 were active after adding rounds of cuts (0.520 seconds) Gomory was tried 100 times and created 3783 cuts of which 13 were active after adding rounds of cuts (0.092 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 100 times and created 236 cuts of which 0 were active after adding rounds of cuts (0.080 seconds) Result - Finished objective 30 after 13302 nodes and 144504 iterations - took 64.57 seconds (total time 64.57) Total time 64.57 Solved to optimality. Writing solution. Objective: 30 Time: 64.58 s --- Restarting execution --- stein45.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job stein45.gms Stop 08/21/08 14:46:02 elapsed 0:01:04.702