--- Job khb05250 Start 08/21/08 08:03:25 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 --- khb05250.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/khb05250.gdx --- khb05250.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.036 --- khb05250.gms(123) 4 Mb --- Generating MIP model m --- khb05250.gms(124) 4 Mb --- 102 rows 1,351 columns 3,974 non-zeroes --- 24 discrete-columns --- khb05250.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.052 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 1350 columns and 101 rows. 24 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 9.59195e+07 - 0.01 seconds processed model has 99 rows, 1298 columns (24 integer) and 2619 elements Pass 1: obj. 2.65360 --> up = 0 , down = 0 -- rand = 13 ( 24) - solution found of 1.33701e+08 Before mini branch and bound, 5 integers at bound fixed and 1218 continuous Full problem 99 rows 1298 columns, reduced to 9 rows 23 columns Mini branch and bound improved solution from 1.33701e+08 to 1.23809e+08 (0.02 seconds) Freeing continuous variables gives a solution of 1.22106e+08 Round again with cutoff of 1.19488e+08 Pass 2: obj. 2.65360 --> up = 0 , down = 0 -- rand = 12 ( 22) Pass 3: obj. 0.39733 --> up = 0 , down = 0 -- rand = 2 ( 25) Pass 4: obj. 0.83436 --> up = 0 , down = 1 Pass 5: obj. 0.09043 --> up = 0 , down = 0 -- rand = 1 ( 11) perturbation applied Pass 6: obj. -0.00000 --> up = 0 , down = 0 -- rand = 0 ( 24) - solution found of 1.19488e+08 Before mini branch and bound, 4 integers at bound fixed and 1197 continuous Full problem 99 rows 1298 columns, reduced to 22 rows 51 columns Mini branch and bound improved solution from 1.19488e+08 to 1.18257e+08 (0.04 seconds) After 0.04 seconds - Feasibility pump exiting - took 0.04 seconds Integer solution of 1.18257e+08 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Full problem 99 rows 1298 columns, reduced to 87 rows 986 columns - too large 73 added rows had average density of 51.6164 At root node, 73 cuts changed objective from 9.59195e+07 to 1.06925e+08 in 21 passes Cut generator 0 (Probing) - 68 row cuts (23 active), 0 column cuts in 0.020 seconds - new frequency is 1 Cut generator 1 (Gomory) - 44 row cuts (2 active), 0 column cuts in 0.020 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 70 row cuts (22 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 40 row cuts (21 active), 0 column cuts in 0.016 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1.18257e+08 best solution, best possible 1.06925e+08 (0.24 seconds) Integer solution of 1.11805e+08 found by rounding after 292 iterations and 1 nodes (0.28 seconds) Full problem 99 rows 1298 columns, reduced to 95 rows 1194 columns - too large Integer solution of 1.09575e+08 found by rounding after 293 iterations and 2 nodes (0.31 seconds) Full problem 99 rows 1298 columns, reduced to 95 rows 1194 columns - too large Search completed - best objective 106940226, took 571 iterations and 12 nodes (0.42 seconds) Strong branching done 62 times (1290 iterations), fathomed 1 nodes and fixed 0 variables Maximum depth 5, 0 variables fixed on reduced cost Cuts at root node changed objective from 9.59195e+07 to 1.06925e+08 Probing was tried 27 times and created 69 cuts of which 24 were active after adding rounds of cuts (0.024 seconds) Gomory was tried 24 times and created 44 cuts of which 2 were active after adding rounds of cuts (0.020 seconds) Knapsack was tried 21 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Clique was tried 21 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 27 times and created 71 cuts of which 23 were active after adding rounds of cuts (0.012 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 21 times and created 40 cuts of which 21 were active after adding rounds of cuts (0.016 seconds) Result - Finished objective 106940226 after 12 nodes and 571 iterations - took 0.44 seconds (total time 0.44) Total time 0.46 Solved to optimality. Writing solution. Objective: 1.0694e+08 Time: 0.46 s --- Restarting execution --- khb05250.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job khb05250.gms Stop 08/21/08 08:03:25 elapsed 0:00:00.541