--- Job air05 Start 08/21/08 17:35:29 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 --- air05.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/air05.gdx --- air05.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.039 --- air05.gms(123) 5 Mb --- Generating MIP model m --- air05.gms(124) 8 Mb --- 427 rows 7,196 columns 59,317 non-zeroes --- 7,195 discrete-columns --- air05.gms(124) 8 Mb --- Executing COINCBC: elapsed 0:00:00.165 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 7195 columns and 426 rows. 7195 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 25877.6 - 1.46 seconds 43 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 752 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 4 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 2 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 349 rows, 6437 columns (6437 integer) and 40552 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 19.87879 obj. 30344.5 iterations 1751 Pass 2: suminf. 7.00000 obj. 30897 iterations 1842 Pass 3: suminf. 4.66667 obj. 30887.3 iterations 153 Pass 4: suminf. 0.00000 obj. 30686 iterations 7 Solution found of 30686 Before mini branch and bound, 6130 integers at bound fixed and 0 continuous Full problem 349 rows 6437 columns, reduced to 222 rows 283 columns Mini branch and bound improved solution from 30686 to 30534 (2.10 seconds) Freeing continuous variables gives a solution of 30534 Round again with cutoff of 30068.4 Pass 5: suminf. 18.84848 obj. 29941.5 iterations 1970 Pass 6: suminf. 8.75183 obj. 30068.4 iterations 2487 Pass 7: suminf. 0.32578 obj. 30068.4 iterations 568 Pass 8: suminf. 0.19998 obj. 30068.4 iterations 728 Pass 9: suminf. 6.50000 obj. 29069.5 iterations 2083 Pass 10: suminf. 0.00000 obj. 29144 iterations 392 Solution found of 29144 Before mini branch and bound, 6071 integers at bound fixed and 0 continuous Full problem 349 rows 6437 columns, reduced to 230 rows 347 columns Mini branch and bound improved solution from 29144 to 26791 (6.74 seconds) After 6.74 seconds - Feasibility pump exiting with objective of 26791 - took 6.73 seconds Integer solution of 26791 found by feasibility pump after 0 iterations and 0 nodes (6.75 seconds) Full problem 349 rows 6437 columns, reduced to 0 rows 0 columns Full problem 349 rows 6437 columns, reduced to 147 rows 1879 columns Integer solution of 26677 found by greedy equality after 0 iterations and 0 nodes (7.86 seconds) Full problem 349 rows 6437 columns, reduced to 0 rows 0 columns Integer solution of 26651 found by combine solutions after 602 iterations and 0 nodes (11.52 seconds) 26 added rows had average density of 6.61538 At root node, 26 cuts changed objective from 25877.6 to 25955.8 in 16 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 2.196 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.372 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.064 seconds - new frequency is -100 Cut generator 3 (Clique) - 149 row cuts (25 active), 0 column cuts in 0.056 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 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.032 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.380 seconds - new frequency is -100 After 0 nodes, 1 on tree, 26651 best solution, best possible 25955.8 (12.44 seconds) Strong branching is fixing too many variables, too expensively! After 100 nodes, 26 on tree, 26651 best solution, best possible 26076.1 (58.92 seconds) Full problem 349 rows 6437 columns, reduced to 35 rows 32 columns After 200 nodes, 21 on tree, 26374 best solution, best possible 26189.3 (83.33 seconds) Search completed - best objective 26374, took 39325 iterations and 268 nodes (91.68 seconds) Strong branching done 3612 times (237963 iterations), fathomed 32 nodes and fixed 123 variables Maximum depth 55, 171244 variables fixed on reduced cost Cuts at root node changed objective from 25877.6 to 25955.8 Probing was tried 35 times and created 0 cuts of which 3 were active after adding rounds of cuts (2.260 seconds) Gomory was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.372 seconds) Knapsack was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.064 seconds) Clique was tried 89 times and created 1115 cuts of which 293 were active after adding rounds of cuts (0.192 seconds) MixedIntegerRounding2 was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) FlowCover was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) TwoMirCuts was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.380 seconds) Result - Finished objective 26374 after 268 nodes and 39325 iterations - took 92.85 seconds (total time 94.31) Total time 94.35 Solved to optimality. MIP solution: 26374 (268 nodes, 94.36 seconds) Best possible: 26374 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- air05.gms(124) 0 Mb --- Reading solution for model m --- air05.gms(124) 4 Mb *** Status: Normal completion --- Job air05.gms Stop 08/21/08 17:37:04 elapsed 0:01:34.791