--- Job 10teams Start 08/23/08 21:28:39 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 --- 10teams.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/10teams.gdx --- 10teams.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.035 --- 10teams.gms(123) 4 Mb --- Generating MIP model m --- 10teams.gms(124) 4 Mb --- 231 rows 2,026 columns 14,176 non-zeroes --- 1,800 discrete-columns --- 10teams.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.073 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 2025 columns and 230 rows. 1800 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 917 - 0.14 seconds Optimal - objective value 917 200 variables fixed processed model has 210 rows, 1600 columns (1600 integer) and 9600 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 24.30878 (154) obj. 947.552 iterations 1071 Pass 2: suminf. 21.71393 (159) obj. 955.757 iterations 295 Pass 3: suminf. 18.07843 (121) obj. 953.067 iterations 663 Pass 4: suminf. 12.94559 (150) obj. 947.917 iterations 634 Pass 5: suminf. 6.85096 (135) obj. 938.145 iterations 603 Pass 6: suminf. 6.44862 (113) obj. 935.163 iterations 220 Pass 7: suminf. 6.44862 (113) obj. 935.163 iterations 0 Pass 8: suminf. 35.63625 (166) obj. 1028.35 iterations 974 Pass 9: suminf. 20.82564 (118) obj. 1039.15 iterations 774 Pass 10: suminf. 18.71072 (127) obj. 1031.64 iterations 386 Pass 11: suminf. 14.97788 (144) obj. 1031.19 iterations 583 Pass 12: suminf. 14.19945 (120) obj. 1031.38 iterations 528 Pass 13: suminf. 14.29067 (127) obj. 1023.95 iterations 221 Pass 14: suminf. 13.94003 (121) obj. 1019.18 iterations 168 Pass 15: suminf. 12.51403 (138) obj. 1019.2 iterations 257 Pass 16: suminf. 12.53525 (145) obj. 1019.45 iterations 159 Pass 17: suminf. 11.92194 (140) obj. 1019.55 iterations 365 Pass 18: suminf. 12.30496 (138) obj. 1019.34 iterations 242 Pass 19: suminf. 10.99323 (124) obj. 1020.81 iterations 333 Pass 20: suminf. 10.51258 (111) obj. 1020.32 iterations 245 No solution found this major pass Before mini branch and bound, 761 integers at bound fixed and 0 continuous Full problem 210 rows 1600 columns, reduced to 210 rows 839 columns - too large Mini branch and bound did not improve solution (1.11 seconds) Full problem 211 rows 1600 columns, reduced to 211 rows 1600 columns - too large After 1.42 seconds - Feasibility pump exiting - took 1.42 seconds 8 added rows had average density of 33.375 At root node, 8 cuts changed objective from 917 to 924 in 10 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.520 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 16 row cuts, 0 column cuts (2 active) in 0.108 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 3 (Clique) - 88 row cuts, 0 column cuts (6 active) in 0.012 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 16 row cuts, 0 column cuts (0 active) in 0.076 seconds - new frequency is -100 Optimal - objective value 924 Optimal - objective value 924 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 924 (4.54 seconds) Integer solution of 924 found after 29002 iterations and 147 nodes (12.02 seconds) Search completed - best objective 924.0000000000001, took 29002 iterations and 147 nodes (12.03 seconds) Strong branching done 1286 times (23497 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 17, 0 variables fixed on reduced cost Cuts at root node changed objective from 917 to 924 Probing was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.520 seconds) Gomory was tried 265 times and created 16 cuts of which 2 were active after adding rounds of cuts (0.640 seconds) Knapsack was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Clique was tried 265 times and created 1924 cuts of which 566 were active after adding rounds of cuts (0.256 seconds) MixedIntegerRounding2 was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) FlowCover was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 10 times and created 16 cuts of which 0 were active after adding rounds of cuts (0.076 seconds) implication was tried 264 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 924 after 147 nodes and 29002 iterations - took 12.19 seconds (total time 12.34) Total time 12.36 Solved to optimality. MIP solution: 924 (147 nodes, 12.36 seconds) Best possible: 924 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- 10teams.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job 10teams.gms Stop 08/23/08 21:28:52 elapsed 0:00:12.588