--- Job stein27 Start 08/22/08 04:24:47 GAMS Rev 228 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.004 --- 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.008 GAMS/CoinCbc 2.1 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.10.00, build Jun 21 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: suminf. 7.00000 obj. 13 iterations 0 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 54 rows 21 columns Mini branch and bound improved solution from 27 to 18 (0.05 seconds) Round again with cutoff of 17.5 Pass 2: suminf. 7.00000 obj. 13 iterations 0 Pass 3: suminf. 1.35714 obj. 17.5 iterations 19 Pass 4: suminf. 0.83333 obj. 17.5 iterations 12 Pass 5: suminf. 8.60000 obj. 13 iterations 3 Pass 6: suminf. 5.33333 obj. 16.3333 iterations 35 Pass 7: suminf. 3.50000 obj. 17.5 iterations 6 Pass 8: suminf. 2.62500 obj. 17.5 iterations 17 Pass 9: suminf. 4.00000 obj. 16 iterations 31 Pass 10: suminf. 3.00000 obj. 17 iterations 9 Pass 11: suminf. 3.16667 obj. 17.5 iterations 1 Pass 12: suminf. 2.83333 obj. 17.5 iterations 1 Pass 13: suminf. 2.50000 obj. 17.5 iterations 8 Pass 14: suminf. 2.50000 obj. 17.5 iterations 0 Pass 15: suminf. 2.50000 obj. 17.5 iterations 6 Pass 16: suminf. 2.50000 obj. 17.5 iterations 1 Pass 17: suminf. 2.50000 obj. 17.5 iterations 7 Pass 18: suminf. 3.16667 obj. 17.5 iterations 17 Pass 19: suminf. 3.16667 obj. 17.5 iterations 3 Pass 20: suminf. 2.62500 obj. 17.5 iterations 24 Pass 21: suminf. 2.62500 obj. 17.5 iterations 2 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.13 seconds) After 0.13 seconds - Feasibility pump exiting with objective of 12 - took 0.13 seconds Integer solution of 18 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) Full problem 118 rows 27 columns, reduced to 0 rows 0 columns 4 added rows had average density of 12.75 At root node, 4 cuts changed objective from 13 to 13 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.044 seconds - new frequency is 10 Cut generator 1 (Gomory) - 2246 row cuts (4 active), 0 column cuts in 0.024 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) - 0 row cuts (0 active), 0 column cuts in 0.032 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) - 140 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is -100 After 0 nodes, 1 on tree, 18 best solution, best possible 13 (0.38 seconds) Search completed - best objective 18, took 9161 iterations and 628 nodes (2.93 seconds) Strong branching done 9072 times (62871 iterations), fathomed 274 nodes and fixed 23 variables Maximum depth 11, 6 variables fixed on reduced cost Cuts at root node changed objective from 13 to 13 Probing was tried 161 times and created 147 cuts of which 78 were active after adding rounds of cuts (0.060 seconds) Gomory was tried 297 times and created 5309 cuts of which 431 were active after adding rounds of cuts (0.052 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 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 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) FlowCover was tried 100 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 140 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) Result - Finished objective 18 after 628 nodes and 9161 iterations - took 2.93 seconds (total time 2.94) Total time 2.94 Solved to optimality. MIP solution: 18 (628 nodes, 2.94 seconds) Best possible: 18 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- stein27.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job stein27.gms Stop 08/22/08 04:24:50 elapsed 0:00:02.971