--- Job p0548 Start 08/22/08 01:34:39 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 --- p0548.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0548.gdx --- p0548.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- p0548.gms(123) 4 Mb --- Generating MIP model m --- p0548.gms(124) 4 Mb --- 177 rows 549 columns 2,128 non-zeroes --- 548 discrete-columns --- p0548.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.016 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 548 columns and 176 rows. 548 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 315.255 - 0.00 seconds 17 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 17 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 143 rows, 459 columns (459 integer) and 1338 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 0.62216 obj. 587 iterations 44 Pass 2: suminf. 0.70660 obj. 1014 iterations 36 Pass 3: suminf. 0.52577 obj. 1014 iterations 29 Pass 4: suminf. 0.63004 obj. 1014 iterations 32 Pass 5: suminf. 0.49180 obj. 1014 iterations 29 Pass 6: suminf. 0.50103 obj. 1014 iterations 32 Pass 7: suminf. 0.43914 obj. 1014 iterations 29 Pass 8: suminf. 0.50103 obj. 1014 iterations 30 Pass 9: suminf. 3.13161 obj. 24887.7 iterations 115 Pass 10: suminf. 2.88161 obj. 24887.7 iterations 4 Pass 11: suminf. 0.31376 obj. 35889 iterations 65 Pass 12: suminf. 0.26949 obj. 35889 iterations 23 Pass 13: suminf. 0.34292 obj. 35889 iterations 25 Pass 14: suminf. 0.34292 obj. 35889 iterations 1 Pass 15: suminf. 0.31376 obj. 35889 iterations 20 Pass 16: suminf. 1.66071 obj. 42384.5 iterations 109 Pass 17: suminf. 1.05501 obj. 42331 iterations 34 Pass 18: suminf. 0.63328 obj. 43375.2 iterations 29 Pass 19: suminf. 0.59766 obj. 43355.1 iterations 6 Pass 20: suminf. 1.01649 obj. 43377.4 iterations 35 No solution found this major pass Before mini branch and bound, 273 integers at bound fixed and 0 continuous Mini branch and bound did not improve solution (0.04 seconds) Full problem 144 rows 459 columns, reduced to 143 rows 458 columns - too large After 0.06 seconds - Feasibility pump exiting - took 0.06 seconds 100 added rows had average density of 9.36 At root node, 100 cuts changed objective from 539.158 to 8690.15 in 12 passes Cut generator 0 (Probing) - 111 row cuts (21 active), 1 column cuts in 0.096 seconds - new frequency is 1 Cut generator 1 (Gomory) - 22 row cuts (3 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 298 row cuts (44 active), 0 column cuts in 0.016 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 61 row cuts (13 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 188 row cuts (19 active), 0 column cuts in 0.016 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 8690.15 (0.28 seconds) Search completed - best objective 8691, took 356 iterations and 2 nodes (0.32 seconds) Strong branching done 74 times (446 iterations), fathomed 1 nodes and fixed 0 variables Maximum depth 1, 0 variables fixed on reduced cost Cuts at root node changed objective from 539.158 to 8690.15 Probing was tried 14 times and created 111 cuts of which 21 were active after adding rounds of cuts (0.100 seconds) Gomory was tried 12 times and created 22 cuts of which 3 were active after adding rounds of cuts (0.012 seconds) Knapsack was tried 14 times and created 299 cuts of which 45 were active after adding rounds of cuts (0.020 seconds) Clique was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 12 times and created 61 cuts of which 13 were active after adding rounds of cuts (0.012 seconds) FlowCover was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 12 times and created 188 cuts of which 19 were active after adding rounds of cuts (0.016 seconds) Result - Finished objective 8691 after 2 nodes and 356 iterations - took 0.36 seconds (total time 0.37) Total time 0.37 Solved to optimality. MIP solution: 8691 (2 nodes, 0.37 seconds) Best possible: 8691 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- p0548.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0548.gms Stop 08/22/08 01:34:39 elapsed 0:00:00.415