--- Job p0548 Start 08/24/08 05:20:42 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 --- 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.007 --- 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 Cbc: elapsed 0:00:00.018 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 315.255 - 0.00 seconds Optimal - objective value 315.255 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 (26) obj. 587 iterations 41 Pass 2: suminf. 0.70660 (23) obj. 1014 iterations 32 Pass 3: suminf. 0.52577 (23) obj. 1014 iterations 25 Pass 4: suminf. 0.63004 (23) obj. 1014 iterations 28 Pass 5: suminf. 0.49180 (23) obj. 1014 iterations 25 Pass 6: suminf. 0.50103 (22) obj. 1014 iterations 28 Pass 7: suminf. 0.43914 (22) obj. 1014 iterations 25 Pass 8: suminf. 0.50103 (22) obj. 1014 iterations 26 Pass 9: suminf. 3.13161 (30) obj. 24887.7 iterations 114 Pass 10: suminf. 2.88161 (29) obj. 24887.7 iterations 4 Pass 11: suminf. 0.31376 (14) obj. 35889 iterations 63 Pass 12: suminf. 0.26949 (14) obj. 35889 iterations 22 Pass 13: suminf. 0.34292 (14) obj. 35889 iterations 24 Pass 14: suminf. 0.34292 (14) obj. 35889 iterations 1 Pass 15: suminf. 0.31376 (14) obj. 35889 iterations 22 Pass 16: suminf. 1.66071 (16) obj. 42384.5 iterations 107 Pass 17: suminf. 1.05501 (13) obj. 42331 iterations 33 Pass 18: suminf. 0.63328 (10) obj. 43375.2 iterations 28 Pass 19: suminf. 0.59766 (10) obj. 43355.1 iterations 6 Pass 20: suminf. 1.01649 (10) obj. 43377.4 iterations 34 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 92 added rows had average density of 14.4565 At root node, 92 cuts changed objective from 539.158 to 8690.31 in 10 passes Cut generator 0 (Probing) - 106 row cuts, 2 column cuts (81 active) in 0.144 seconds - new frequency is 1 Cut generator 1 (Gomory) - 95 row cuts, 0 column cuts (11 active) in 0.000 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 312 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 58 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 217 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Optimal - objective value 8690.31 Optimal - objective value 8690.31 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 8690.31 (0.31 seconds) Integer solution of 8993 found after 4981 iterations and 138 nodes (2.99 seconds) Full problem 143 rows 459 columns, reduced to 80 rows 136 columns Integer solution of 8871 found by combine solutions after 4982 iterations and 139 nodes (3.01 seconds) Integer solution of 8691 found after 5041 iterations and 144 nodes (3.04 seconds) Search completed - best objective 8691, took 5041 iterations and 144 nodes (3.04 seconds) Strong branching done 2560 times (16129 iterations), fathomed 1 nodes and fixed 17 variables Maximum depth 10, 212 variables fixed on reduced cost Cuts at root node changed objective from 539.158 to 8690.31 Probing was tried 285 times and created 775 cuts of which 477 were active after adding rounds of cuts (0.428 seconds) Gomory was tried 284 times and created 1065 cuts of which 314 were active after adding rounds of cuts (0.132 seconds) Knapsack was tried 285 times and created 4023 cuts of which 483 were active after adding rounds of cuts (0.148 seconds) Clique was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 285 times and created 682 cuts of which 13 were active after adding rounds of cuts (0.144 seconds) FlowCover was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 10 times and created 217 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) implication was tried 275 times and created 1617 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 8691 after 144 nodes and 5041 iterations - took 3.08 seconds (total time 3.09) Total time 3.09 Solved to optimality. MIP solution: 8691 (144 nodes, 3.1 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/24/08 05:20:45 elapsed 0:00:03.152