--- Job misc07 Start 08/24/08 03:25:03 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 --- misc07.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/misc07.gdx --- misc07.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.011 --- misc07.gms(123) 4 Mb --- Generating MIP model m --- misc07.gms(124) 4 Mb --- 213 rows 261 columns 8,621 non-zeroes --- 259 discrete-columns --- misc07.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.030 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 260 columns and 212 rows. 259 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 1415 - 0.01 seconds Optimal - objective value 1415 21 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 21 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 211 rows, 232 columns (232 integer) and 8260 elements Objective coefficients multiple of 5 Cutoff increment increased from 1e-05 to 4.995 Pass 1: suminf. 8.00000 (16) obj. 1415 iterations 30 Pass 2: suminf. 6.66667 (19) obj. 1777.5 iterations 44 Pass 3: suminf. 6.66667 (19) obj. 1777.5 iterations 5 Pass 4: suminf. 6.66667 (19) obj. 1777.5 iterations 9 Pass 5: suminf. 9.53571 (28) obj. 3334.46 iterations 74 Pass 6: suminf. 8.28571 (20) obj. 2974.46 iterations 26 Pass 7: suminf. 6.19048 (35) obj. 2732.86 iterations 31 Pass 8: suminf. 6.28571 (20) obj. 2535.71 iterations 26 Pass 9: suminf. 6.00000 (19) obj. 2750 iterations 7 Pass 10: suminf. 6.00000 (19) obj. 2750 iterations 4 Pass 11: suminf. 6.00000 (19) obj. 2750 iterations 2 Pass 12: suminf. 9.39683 (30) obj. 3641.27 iterations 64 Pass 13: suminf. 9.03571 (27) obj. 3886.96 iterations 22 Pass 14: suminf. 7.00000 (28) obj. 3512.5 iterations 17 Pass 15: suminf. 6.95238 (23) obj. 3526.55 iterations 6 Pass 16: suminf. 6.66667 (22) obj. 3740.83 iterations 6 Pass 17: suminf. 6.66667 (22) obj. 3740.83 iterations 4 Pass 18: suminf. 8.59677 (33) obj. 3757.66 iterations 61 Pass 19: suminf. 5.33333 (32) obj. 3777.5 iterations 28 Pass 20: suminf. 4.66667 (25) obj. 3674.58 iterations 11 No solution found this major pass Before mini branch and bound, 91 integers at bound fixed and 0 continuous Full problem 211 rows 232 columns, reduced to 211 rows 141 columns - too large Mini branch and bound did not improve solution (0.06 seconds) Full problem 212 rows 232 columns, reduced to 212 rows 232 columns - too large After 0.09 seconds - Feasibility pump exiting - took 0.09 seconds 5 added rows had average density of 193.8 At root node, 5 cuts changed objective from 1415 to 1476.3 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 3.928 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 2744 row cuts, 0 column cuts (5 active) in 0.156 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 6 row cuts, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.024 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.356 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 316 row cuts, 0 column cuts (0 active) in 0.120 seconds - new frequency is -100 Optimal - objective value 1476.3 Optimal - objective value 1476.3 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 1476.3 (5.61 seconds) Strong branching is fixing too many variables, too expensively! Full problem 211 rows 232 columns, reduced to 15 rows 8 columns Full problem 211 rows 232 columns, reduced to 63 rows 22 columns Full problem 211 rows 232 columns, reduced to 66 rows 31 columns Integer solution of 2810 found by combine solutions after 20839 iterations and 449 nodes (18.56 seconds) After 1000 nodes, 185 on tree, 2810 best solution, best possible 1609.88 (28.61 seconds) After 2000 nodes, 234 on tree, 2810 best solution, best possible 1628.08 (39.42 seconds) After 3000 nodes, 281 on tree, 2810 best solution, best possible 1706 (46.25 seconds) After 4000 nodes, 313 on tree, 2810 best solution, best possible 1745.22 (52.61 seconds) After 5000 nodes, 324 on tree, 2810 best solution, best possible 2052.68 (58.67 seconds) After 6000 nodes, 306 on tree, 2810 best solution, best possible 2052.68 (63.15 seconds) After 7000 nodes, 299 on tree, 2810 best solution, best possible 2063.44 (68.12 seconds) After 8000 nodes, 275 on tree, 2810 best solution, best possible 2063.44 (72.67 seconds) After 9000 nodes, 251 on tree, 2810 best solution, best possible 2187.24 (77.24 seconds) After 10000 nodes, 214 on tree, 2810 best solution, best possible 2187.24 (81.67 seconds) After 11000 nodes, 173 on tree, 2810 best solution, best possible 2187.24 (85.58 seconds) After 12000 nodes, 239 on tree, 2810 best solution, best possible 2589 (91.08 seconds) After 13000 nodes, 111 on tree, 2810 best solution, best possible 2746.25 (94.53 seconds) Search completed - best objective 2810, took 215180 iterations and 13290 nodes (95.05 seconds) Strong branching done 32226 times (552535 iterations), fathomed 750 nodes and fixed 5153 variables Maximum depth 100, 135027 variables fixed on reduced cost Cuts at root node changed objective from 1415 to 1476.3 Probing was tried 11027 times and created 26107 cuts of which 2923 were active after adding rounds of cuts (23.197 seconds) Gomory was tried 2859 times and created 24886 cuts of which 921 were active after adding rounds of cuts (1.720 seconds) Knapsack was tried 100 times and created 6 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) MixedIntegerRounding2 was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.356 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) TwoMirCuts was tried 100 times and created 316 cuts of which 0 were active after adding rounds of cuts (0.120 seconds) implication was tried 10901 times and created 147157 cuts of which 28 were active after adding rounds of cuts Result - Finished objective 2810 after 13290 nodes and 215180 iterations - took 95.82 seconds (total time 95.83) Total time 95.84 Solved to optimality. MIP solution: 2810 (13290 nodes, 95.84 seconds) Best possible: 2810 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- misc07.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job misc07.gms Stop 08/24/08 03:26:39 elapsed 0:01:36.250