--- Job neos4 Start 08/24/08 04:34:06 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 --- neos4.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/neos4.gdx --- neos4.gms(148) 10 Mb --- Starting execution: elapsed 0:00:00.227 --- neos4.gms(123) 11 Mb --- Generating MIP model m --- neos4.gms(124) 18 Mb --- 38,578 rows 22,885 columns 116,041 non-zeroes --- 17,172 discrete-columns --- neos4.gms(124) 18 Mb --- Executing Cbc: elapsed 0:00:00.847 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 22884 columns and 38577 rows. 17172 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 -5.05064e+10 - 1.09 seconds Optimal - objective value -5.05064e+10 36 fixed, 24 tightened bounds, 2169 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 57 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 35 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 35 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 35 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 35 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 35 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 35 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 35 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 35 strengthened rows, 0 substitutions processed model has 3354 rows, 3268 columns (78 integer) and 11199 elements Pass 1: (0.12 seconds) suminf. 0.00000 (0) obj. -4.82057e+10 iterations 364 Pass 2: (0.13 seconds) suminf. 0.00000 (0) obj. -4.82057e+10 iterations 0 Pass 3: (0.52 seconds) suminf. 0.20870 (2) obj. -4.77554e+10 iterations 2289 Pass 4: (0.53 seconds) suminf. 0.00000 (0) obj. -4.77544e+10 iterations 12 Solution found of -4.77544e+10 Before mini branch and bound, 69 integers at bound fixed and 2156 continuous Full problem 3354 rows 3268 columns, reduced to 1085 rows 972 columns Mini branch and bound improved solution from -4.77544e+10 to -4.85993e+10 (0.92 seconds) Freeing continuous variables gives a solution of -4.86034e+10 Round again with cutoff of -4.86604e+10 Pass 5: (1.30 seconds) suminf. 0.36019 (2) obj. -4.86604e+10 iterations 118 Pass 6: (1.42 seconds) suminf. 0.49798 (2) obj. -4.86604e+10 iterations 179 Pass 7: (1.44 seconds) suminf. 0.62805 (2) obj. -4.86604e+10 iterations 59 Pass 8: (1.48 seconds) suminf. 0.22154 (2) obj. -4.86604e+10 iterations 88 Pass 9: (1.49 seconds) suminf. 0.26154 (2) obj. -4.86604e+10 iterations 1 Pass 10: (1.63 seconds) suminf. 0.63019 (6) obj. -4.86604e+10 iterations 628 Pass 11: (1.70 seconds) suminf. 0.35268 (2) obj. -4.86604e+10 iterations 285 Pass 12: (1.74 seconds) suminf. 0.84174 (3) obj. -4.86604e+10 iterations 164 Pass 13: (1.78 seconds) suminf. 0.35887 (2) obj. -4.86604e+10 iterations 173 Pass 14: (1.92 seconds) suminf. 1.22210 (6) obj. -4.86604e+10 iterations 520 Pass 15: (2.66 seconds) suminf. 1.86751 (8) obj. -4.86604e+10 iterations 2596 Pass 16: (4.20 seconds) suminf. 1.00817 (5) obj. -4.86604e+10 iterations 4510 Pass 17: (4.24 seconds) suminf. 0.95984 (4) obj. -4.86604e+10 iterations 86 Pass 18: (4.93 seconds) suminf. 1.77736 (4) obj. -4.86604e+10 iterations 2177 Pass 19: (5.19 seconds) suminf. 1.02116 (4) obj. -4.86604e+10 iterations 685 Pass 20: (5.26 seconds) suminf. 1.48298 (5) obj. -4.86604e+10 iterations 245 Pass 21: (5.40 seconds) suminf. 1.01986 (4) obj. -4.86604e+10 iterations 256 Pass 22: (5.48 seconds) suminf. 1.35826 (4) obj. -4.86604e+10 iterations 318 Pass 23: (5.56 seconds) suminf. 1.01992 (4) obj. -4.86604e+10 iterations 279 Pass 24: (6.37 seconds) suminf. 1.42282 (4) obj. -4.86604e+10 iterations 2185 No solution found this major pass Before mini branch and bound, 51 integers at bound fixed and 1800 continuous Full problem 3354 rows 3268 columns, reduced to 1501 rows 1402 columns Mini branch and bound did not improve solution (7.05 seconds) After 7.05 seconds - Feasibility pump exiting with objective of -4.86034e+10 - took 7.04 seconds Integer solution of -4.86034e+10 found by feasibility pump after 0 iterations and 0 nodes (7.06 seconds) 9 added rows had average density of 15.5556 At root node, 22 cuts changed objective from -4.91729e+10 to -4.86024e+10 in 5 passes Cut generator 0 (Probing) - 19 row cuts, 60 column cuts (12 active) in 0.056 seconds - new frequency is 1 Cut generator 1 (Gomory) - 3 row cuts, 0 column cuts (3 active) in 0.012 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 1 row cuts, 0 column cuts (1 active) in 0.008 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 26 row cuts, 0 column cuts (6 active) in 0.024 seconds - new frequency is -100 Optimal - objective value -4.86024e+10 Optimal - objective value -4.86024e+10 Search completed - best objective -48603440750.58988, took 917 iterations and 0 nodes (7.64 seconds) Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -4.91729e+10 to -4.86024e+10 Probing was tried 5 times and created 79 cuts of which 12 were active after adding rounds of cuts (0.056 seconds) Gomory was tried 5 times and created 3 cuts of which 3 were active after adding rounds of cuts (0.012 seconds) Knapsack was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) Clique was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 5 times and created 1 cuts of which 1 were active after adding rounds of cuts (0.008 seconds) FlowCover was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) TwoMirCuts was tried 5 times and created 26 cuts of which 6 were active after adding rounds of cuts (0.024 seconds) 794 bounds tightened after postprocessing Result - Finished objective -48603440750.58988 after 0 nodes and 917 iterations - took 12.80 seconds (total time 13.99) Total time 15.52 Solved to optimality. MIP solution: -4.860344075e+10 (0 nodes, 15.57 seconds) Best possible: -4.860344075e+10 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- neos4.gms(124) 0 Mb --- Reading solution for model m --- neos4.gms(124) 14 Mb *** Status: Normal completion --- Job neos4.gms Stop 08/24/08 04:34:24 elapsed 0:00:17.135