--- Job air05 Start 08/23/08 22:11:24 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 --- 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.060 --- 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 Cbc: elapsed 0:00:00.204 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 25877.6 - 1.48 seconds Optimal - objective value 25877.6 109 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 752 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 10 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 2 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 349 rows, 6431 columns (6431 integer) and 40510 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 10.93976 (68) obj. 29418.8 iterations 2237 Pass 2: suminf. 8.38095 (42) obj. 30125.3 iterations 1056 Pass 3: suminf. 0.00000 (0) obj. 30706 iterations 487 Solution found of 30706 Before mini branch and bound, 6136 integers at bound fixed and 0 continuous Full problem 349 rows 6431 columns, reduced to 227 rows 276 columns Mini branch and bound improved solution from 30706 to 30434 (1.78 seconds) Round again with cutoff of 29977 Pass 4: suminf. 18.45299 (98) obj. 29977 iterations 1972 Pass 5: suminf. 11.18211 (109) obj. 29977 iterations 1145 Pass 6: suminf. 8.52290 (108) obj. 29977 iterations 1353 Pass 7: suminf. 8.55987 (85) obj. 29977 iterations 604 Pass 8: suminf. 7.17911 (75) obj. 29977 iterations 885 Pass 9: suminf. 4.63780 (81) obj. 29977 iterations 1170 Pass 10: suminf. 4.21738 (55) obj. 29977 iterations 1347 Pass 11: suminf. 4.21738 (55) obj. 29977 iterations 0 Pass 12: suminf. 6.28177 (70) obj. 29977 iterations 722 Pass 13: suminf. 4.05467 (69) obj. 29977 iterations 1597 Pass 14: suminf. 4.22044 (27) obj. 29977 iterations 2411 Pass 15: suminf. 0.00000 (0) obj. 29701 iterations 1592 Solution found of 29701 Before mini branch and bound, 5981 integers at bound fixed and 0 continuous Full problem 349 rows 6431 columns, reduced to 238 rows 438 columns Mini branch and bound improved solution from 29701 to 27938 (10.46 seconds) Freeing continuous variables gives a solution of 27938 After 10.46 seconds - Feasibility pump exiting with objective of 27938 - took 10.45 seconds Integer solution of 27938 found by feasibility pump after 0 iterations and 0 nodes (10.47 seconds) Full problem 349 rows 6431 columns, reduced to 164 rows 1833 columns Integer solution of 26677 found by greedy equality after 0 iterations and 0 nodes (13.92 seconds) 27 added rows had average density of 6.2963 At root node, 27 cuts changed objective from 25877.6 to 25956.2 in 13 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 5.428 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 0 row cuts, 0 column cuts (0 active) in 0.468 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is -100 Cut generator 3 (Clique) - 145 row cuts, 0 column cuts (26 active) in 0.044 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.024 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) - 0 row cuts, 0 column cuts (0 active) in 0.432 seconds - new frequency is -100 Optimal - objective value 25956.2 Optimal - objective value 25956.2 After 0 nodes, 1 on tree, 26677 best solution, best possible 25956.2 (22.26 seconds) Integer solution of 26666 found after 20488 iterations and 96 nodes (33.79 seconds) Full problem 349 rows 6431 columns, reduced to 74 rows 74 columns Integer solution of 26631 found by combine solutions after 20808 iterations and 97 nodes (34.22 seconds) After 100 nodes, 35 on tree, 26631 best solution, best possible 26141.1 (34.86 seconds) Integer solution of 26616 found after 37243 iterations and 194 nodes (42.61 seconds) Full problem 349 rows 6431 columns, reduced to 106 rows 105 columns Integer solution of 26585 found by combine solutions after 37599 iterations and 196 nodes (42.99 seconds) After 200 nodes, 80 on tree, 26585 best solution, best possible 26201.2 (43.28 seconds) Integer solution of 26525 found after 39381 iterations and 219 nodes (43.82 seconds) Full problem 349 rows 6431 columns, reduced to 105 rows 111 columns Integer solution of 26494 found by combine solutions after 39467 iterations and 220 nodes (44.04 seconds) After 300 nodes, 94 on tree, 26494 best solution, best possible 26281 (49.33 seconds) After 400 nodes, 113 on tree, 26494 best solution, best possible 26311.8 (53.95 seconds) Integer solution of 26374 found after 76582 iterations and 483 nodes (57.82 seconds) After 500 nodes, 46 on tree, 26374 best solution, best possible 26341.2 (58.34 seconds) After 600 nodes, 12 on tree, 26374 best solution, best possible 26362.8 (60.19 seconds) Search completed - best objective 26374, took 83263 iterations and 628 nodes (60.58 seconds) Strong branching done 1914 times (19219 iterations), fathomed 3 nodes and fixed 0 variables Maximum depth 29, 291502 variables fixed on reduced cost Cuts at root node changed objective from 25877.6 to 25956.2 Probing was tried 274 times and created 774 cuts of which 113 were active after adding rounds of cuts (6.628 seconds) Gomory was tried 13 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.468 seconds) Knapsack was tried 13 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) Clique was tried 297 times and created 3038 cuts of which 752 were active after adding rounds of cuts (0.780 seconds) MixedIntegerRounding2 was tried 13 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) FlowCover was tried 13 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) TwoMirCuts was tried 13 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.432 seconds) implication was tried 504 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 26374 after 628 nodes and 83263 iterations - took 62.71 seconds (total time 64.20) Total time 64.25 Solved to optimality. MIP solution: 26374 (628 nodes, 64.25 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/23/08 22:12:29 elapsed 0:01:04.871