--- Job stein27 Start 08/21/08 14:44:54 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 --- stein27.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/stein27.gdx --- stein27.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.032 --- stein27.gms(123) 4 Mb --- Generating MIP model m --- stein27.gms(124) 4 Mb --- 119 rows 28 columns 406 non-zeroes --- 27 discrete-columns --- Executing COINCBC: elapsed 0:00:00.036 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 27 columns and 118 rows. 27 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 13 - -0.00 seconds processed model has 118 rows, 27 columns (27 integer) and 378 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 7.00000 --> up = 0 , down = 0 -- rand = 21 ( 28) - solution found of 27 Before mini branch and bound, 6 integers at bound fixed and 0 continuous Full problem 118 rows 27 columns, reduced to 53 rows 21 columns Mini branch and bound improved solution from 27 to 18 (0.06 seconds) Round again with cutoff of 17.5 Pass 2: obj. 7.00000 --> up = 0 , down = 0 -- rand = 17 ( 17) Pass 3: obj. 5.50000 --> up = 0 , down = 9 Pass 4: obj. 3.33333 --> up = 1 , down = 0 Pass 5: obj. 2.83333 --> up = 0 , down = 0 -- rand = 9 ( 16) Pass 6: obj. 4.50000 --> up = 0 , down = 4 Pass 7: obj. 0.83333 --> up = 0 , down = 0 -- rand = 22 ( 22) Pass 8: obj. 9.00000 --> up = 1 , down = 0 Pass 9: obj. 8.00000 --> up = 0 , down = 0 -- rand = 22 ( 27) Pass 10: obj. 9.50000 --> up = 0 , down = 10 Pass 11: obj. 3.50000 --> up = 0 , down = 0 -- rand = 11 ( 29) Pass 12: obj. 3.50000 --> up = 0 , down = 4 Pass 13: obj. 3.50000 --> up = 0 , down = 0 -- rand = 7 ( 27) Pass 14: obj. 3.50000 --> up = 0 , down = 7 perturbation applied Pass 15: obj. 4.16667 --> up = 2 , down = 0 Pass 16: obj. 2.62500 --> up = 0 , down = 0 -- rand = 18 ( 21) Pass 17: obj. 5.00000 --> up = 3 , down = 0 Pass 18: obj. 3.00000 --> up = 0 , down = 0 -- rand = 9 ( 24) Pass 19: obj. 5.50000 --> up = 0 , down = 8 Pass 20: obj. 2.83333 --> up = 0 , down = 0 -- rand = 9 ( 13) Pass 21: obj. 4.50000 --> No solution found this major pass Before mini branch and bound, 0 integers at bound fixed and 0 continuous Full problem 118 rows 27 columns, reduced to 118 rows 27 columns Mini branch and bound did not improve solution (0.14 seconds) After 0.14 seconds - Feasibility pump exiting - took 0.14 seconds Integer solution of 18 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) Full problem 118 rows 27 columns, reduced to 0 rows 0 columns 3 added rows had average density of 12.3333 At root node, 3 cuts changed objective from 13 to 13 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.040 seconds - new frequency is 10 Cut generator 1 (Gomory) - 2389 row cuts (3 active), 0 column cuts in 0.024 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.028 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) - 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) - 143 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 After 0 nodes, 1 on tree, 18 best solution, best possible 13 (0.44 seconds) Search completed - best objective 18, took 7808 iterations and 828 nodes (2.95 seconds) Strong branching done 10972 times (57718 iterations), fathomed 401 nodes and fixed 28 variables Maximum depth 11, 6 variables fixed on reduced cost Cuts at root node changed objective from 13 to 13 Probing was tried 182 times and created 361 cuts of which 168 were active after adding rounds of cuts (0.064 seconds) Gomory was tried 100 times and created 2389 cuts of which 3 were active after adding rounds of cuts (0.024 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 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 143 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) Result - Finished objective 18 after 828 nodes and 7808 iterations - took 2.95 seconds (total time 2.95) Total time 2.95 Solved to optimality. Writing solution. Objective: 18 Time: 2.95 s --- Restarting execution --- stein27.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job stein27.gms Stop 08/21/08 14:44:57 elapsed 0:00:03.021