--- Job neos4 Start 08/21/08 10:53:27 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.254 --- 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 COINCBC: elapsed 0:00:00.876 GAMS/CoinCbc 2.0 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.00.00, build Mar 20 2008 command line - GAMS/CBC -solve -quit Continuous objective value is -5.05064e+10 - 1.00 seconds 253 fixed, 151 tightened bounds, 2253 strengthened rows, 0 substitutions 0 fixed, 3 tightened bounds, 56 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 51 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 41 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 40 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 40 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 40 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 40 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 40 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 40 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 40 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 40 strengthened rows, 0 substitutions processed model has 11339 rows, 7435 columns (4088 integer) and 30717 elements Pass 1: (0.21 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 19) Pass 2: (0.23 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 26) perturbation applied Pass 3: (0.26 seconds) obj. 316.00000 --> up = 311 , down = 5 perturbation applied Pass 4: (0.30 seconds) obj. 292.00000 --> up = 284 , down = 8 perturbation applied Pass 5: (0.34 seconds) obj. 314.00000 --> up = 306 , down = 8 Pass 6: (0.37 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 16) Pass 7: (0.40 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 18) perturbation applied Pass 8: (0.46 seconds) obj. 298.00000 --> up = 294 , down = 4 Pass 9: (0.50 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 22) Pass 10: (0.52 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 27) perturbation applied Pass 11: (0.56 seconds) obj. 300.00000 --> up = 294 , down = 6 perturbation applied Pass 12: (0.60 seconds) obj. 272.00000 --> up = 267 , down = 5 Pass 13: (0.64 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 21) Pass 14: (0.66 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 11) perturbation applied Pass 15: (0.70 seconds) obj. 314.00000 --> up = 307 , down = 7 perturbation applied Pass 16: (0.74 seconds) obj. 308.00000 --> up = 303 , down = 5 perturbation applied Pass 17: (0.79 seconds) obj. 311.00000 --> up = 306 , down = 5 Pass 18: (0.82 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 27) Pass 19: (0.85 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 13) perturbation applied Pass 20: (0.90 seconds) obj. 299.00000 --> No solution found this major pass Before mini branch and bound, 4079 integers at bound fixed and 2396 continuous Full problem 11339 rows 7435 columns, reduced to 734 rows 628 columns Mini branch and bound improved solution from 1.79769e+308 to -4.83089e+10 (1.16 seconds) Freeing continuous variables gives a solution of -4.83762e+10 Round again with cutoff of -4.84559e+10 Pass 20: (1.32 seconds) obj. 0.17952 --> up = 0 , down = 0 -- rand = 2 ( 17) Pass 21: (1.48 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 28) Pass 22: (1.50 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 11) perturbation applied Pass 23: (1.56 seconds) obj. 295.00000 --> up = 287 , down = 8 perturbation applied Pass 24: (1.67 seconds) obj. 310.00000 --> up = 304 , down = 6 Pass 25: (1.74 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 19) Pass 26: (1.77 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 19) perturbation applied Pass 27: (1.84 seconds) obj. 301.00000 --> up = 297 , down = 4 Pass 28: (1.90 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 14) Pass 29: (1.93 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 10) perturbation applied Pass 30: (1.99 seconds) obj. 296.00000 --> up = 287 , down = 9 Pass 31: (2.06 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 28) Pass 32: (2.09 seconds) obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 15) perturbation applied Pass 33: (3.86 seconds) obj. 295.56105 --> up = 286 , down = 5 Pass 34: (4.01 seconds) obj. 0.99759 --> up = 0 , down = 0 -- rand = 4 ( 26) perturbation applied Pass 35: (4.67 seconds) obj. 316.18572 --> up = 308 , down = 8 Pass 36: (4.86 seconds) obj. 1.29837 --> up = 0 , down = 0 -- rand = 7 ( 17) Pass 37: (6.08 seconds) obj. 7.51670 --> up = 0 , down = 4 Pass 38: (6.22 seconds) obj. 1.06618 --> up = 0 , down = 0 -- rand = 4 ( 25) Pass 39: (6.56 seconds) obj. 1.19847 --> No solution found this major pass Before mini branch and bound, 4064 integers at bound fixed and 1908 continuous Full problem 11339 rows 7435 columns, reduced to 1456 rows 1344 columns Mini branch and bound improved solution from -4.83762e+10 to -4.86034e+10 (8.00 seconds) Freeing continuous variables gives a solution of -4.86034e+10 After 8.04 seconds - Feasibility pump exiting - took 8.02 seconds Integer solution of -4.86034e+10 found by feasibility pump after 0 iterations and 0 nodes (8.04 seconds) Full problem 11339 rows 7435 columns, reduced to 8391 rows 4858 columns - too large 15 added rows had average density of 28.4 At root node, 15 cuts changed objective from -4.91729e+10 to -4.91235e+10 in 20 passes Cut generator 0 (Probing) - 191 row cuts (8 active), 0 column cuts in 0.188 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 21 row cuts (2 active), 0 column cuts in 0.384 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 1 row cuts (1 active), 0 column cuts in 0.264 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 43 row cuts (4 active), 0 column cuts in 0.152 seconds - new frequency is -100 After 0 nodes, 1 on tree, -4.86034e+10 best solution, best possible -4.91235e+10 (10.77 seconds) Strong branching is fixing too many variables, too expensively! Search completed - best objective -48603440750.58967, took 5671 iterations and 64 nodes (24.11 seconds) Strong branching done 362 times (18805 iterations), fathomed 12 nodes and fixed 45 variables Maximum depth 24, 237 variables fixed on reduced cost Cuts at root node changed objective from -4.91729e+10 to -4.91235e+10 Probing was tried 32 times and created 193 cuts of which 8 were active after adding rounds of cuts (0.280 seconds) Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Knapsack was tried 20 times and created 21 cuts of which 2 were active after adding rounds of cuts (0.384 seconds) Clique was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 20 times and created 1 cuts of which 1 were active after adding rounds of cuts (0.264 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) TwoMirCuts was tried 20 times and created 43 cuts of which 4 were active after adding rounds of cuts (0.152 seconds) Result - Finished objective -48603440750.58967 after 64 nodes and 5671 iterations - took 40.32 seconds (total time 41.40) Total time 42.05 Solved to optimality. Writing solution. Objective: -4.86034e+10 Time: 42.08 s --- 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/21/08 10:54:12 elapsed 0:00:44.570