--- Job air04 Start 08/23/08 22:08:50 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 --- air04.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/air04.gdx --- air04.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.078 --- air04.gms(123) 6 Mb --- Generating MIP model m --- air04.gms(124) 10 Mb --- 824 rows 8,905 columns 81,870 non-zeroes --- 8,904 discrete-columns --- air04.gms(124) 10 Mb --- Executing Cbc: elapsed 0:00:00.269 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 8904 columns and 823 rows. 8904 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 55535.4 - 13.54 seconds Optimal - objective value 55535.4 249 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 1139 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 16 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions 2 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 625 rows, 7709 columns (7709 integer) and 50300 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 17.75214 (103) obj. 58760.8 iterations 8694 Pass 2: suminf. 11.64198 (79) obj. 59811.5 iterations 4888 Pass 3: suminf. 4.00000 (8) obj. 58741 iterations 3488 Pass 4: suminf. 4.00000 (8) obj. 58741 iterations 1073 Pass 5: suminf. 4.00000 (8) obj. 58741 iterations 728 Pass 6: suminf. 3.00000 (6) obj. 58741 iterations 887 Pass 7: suminf. 3.00000 (6) obj. 58741 iterations 789 Pass 8: suminf. 3.00000 (6) obj. 58741 iterations 0 Pass 9: suminf. 3.00000 (6) obj. 58741 iterations 372 Pass 10: suminf. 3.00000 (6) obj. 58741 iterations 817 Pass 11: suminf. 3.00000 (6) obj. 58741 iterations 387 Pass 12: suminf. 0.00000 (0) obj. 59606 iterations 922 Solution found of 59606 Before mini branch and bound, 7314 integers at bound fixed and 0 continuous Full problem 625 rows 7709 columns, reduced to 273 rows 338 columns Mini branch and bound improved solution from 59606 to 58446 (15.85 seconds) Round again with cutoff of 58154 Reduced cost fixing fixed 2 variables on major pass 2 Pass 13: suminf. 2.00000 (4) obj. 57918.5 iterations 5718 Pass 14: suminf. 0.00000 (0) obj. 57894 iterations 640 Solution found of 57894 Before mini branch and bound, 7411 integers at bound fixed and 0 continuous Full problem 625 rows 7709 columns, reduced to 230 rows 220 columns Mini branch and bound improved solution from 57894 to 57143 (20.61 seconds) After 20.63 seconds - Feasibility pump exiting with objective of 57143 - took 20.61 seconds Integer solution of 57143 found by feasibility pump after 0 iterations and 0 nodes (20.63 seconds) Full problem 625 rows 7709 columns, reduced to 0 rows 0 columns 25 added rows had average density of 34.8 At root node, 25 cuts changed objective from 55535.4 to 55639 in 14 passes Cut generator 0 (Probing) - 0 row cuts, 7 column cuts (3 active) in 6.400 seconds - new frequency is 1 Cut generator 1 (Gomory) - 1 row cuts, 0 column cuts (1 active) in 0.628 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.040 seconds - new frequency is -100 Cut generator 3 (Clique) - 252 row cuts, 0 column cuts (20 active) in 0.056 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.028 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts, 0 column cuts (0 active) in 0.672 seconds - new frequency is -100 Optimal - objective value 55639 Optimal - objective value 55639 After 0 nodes, 1 on tree, 57143 best solution, best possible 55639 (31.39 seconds) After 100 nodes, 52 on tree, 57143 best solution, best possible 55773 (62.57 seconds) Integer solution of 56948 found after 59788 iterations and 154 nodes (72.84 seconds) Integer solution of 56801 found after 61219 iterations and 164 nodes (73.86 seconds) Full problem 625 rows 7709 columns, reduced to 28 rows 33 columns Integer solution of 56733 found by combine solutions after 61245 iterations and 165 nodes (74.14 seconds) Integer solution of 56589 found after 63461 iterations and 174 nodes (75.22 seconds) After 200 nodes, 64 on tree, 56589 best solution, best possible 55795.2 (78.32 seconds) Integer solution of 56138 found after 67541 iterations and 201 nodes (78.40 seconds) Integer solution of 56137 found after 75457 iterations and 259 nodes (85.41 seconds) After 300 nodes, 44 on tree, 56137 best solution, best possible 55865.3 (90.22 seconds) After 400 nodes, 54 on tree, 56137 best solution, best possible 55908 (97.20 seconds) After 500 nodes, 61 on tree, 56137 best solution, best possible 55936.5 (103.16 seconds) After 600 nodes, 68 on tree, 56137 best solution, best possible 55962.4 (110.33 seconds) After 700 nodes, 72 on tree, 56137 best solution, best possible 55992.2 (116.02 seconds) After 800 nodes, 74 on tree, 56137 best solution, best possible 56021.2 (120.86 seconds) After 900 nodes, 75 on tree, 56137 best solution, best possible 56046.1 (124.94 seconds) After 1000 nodes, 66 on tree, 56137 best solution, best possible 56066.3 (128.63 seconds) After 1100 nodes, 48 on tree, 56137 best solution, best possible 56090.6 (131.89 seconds) After 1200 nodes, 25 on tree, 56137 best solution, best possible 56112.6 (134.09 seconds) Search completed - best objective 56137, took 155738 iterations and 1260 nodes (134.88 seconds) Strong branching done 2112 times (21189 iterations), fathomed 1 nodes and fixed 1 variables Maximum depth 25, 407619 variables fixed on reduced cost Cuts at root node changed objective from 55535.4 to 55639 Probing was tried 470 times and created 656 cuts of which 170 were active after adding rounds of cuts (11.185 seconds) Gomory was tried 14 times and created 1 cuts of which 1 were active after adding rounds of cuts (0.628 seconds) Knapsack was tried 14 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) Clique was tried 469 times and created 5941 cuts of which 1049 were active after adding rounds of cuts (1.652 seconds) MixedIntegerRounding2 was tried 14 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) FlowCover was tried 14 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) TwoMirCuts was tried 14 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.672 seconds) implication was tried 751 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 56137 after 1260 nodes and 155738 iterations - took 138.81 seconds (total time 152.37) Total time 152.45 Solved to optimality. MIP solution: 56137 (1260 nodes, 152.47 seconds) Best possible: 56137 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- air04.gms(124) 0 Mb --- Reading solution for model m --- air04.gms(124) 5 Mb *** Status: Normal completion --- Job air04.gms Stop 08/23/08 22:11:24 elapsed 0:02:33.157