--- Job neos4 Start 07/18/08 14:25:11 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.266 --- 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.879 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" Problem statistics: 22884 columns and 38577 rows. 17172 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is -5.05064e+10 - 1.04 seconds 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, 34 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 34 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 34 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 34 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 34 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 34 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 34 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 34 strengthened rows, 0 substitutions processed model has 3345 rows, 3262 columns (72 integer) and 11179 elements Pass 1: (0.14 seconds) suminf. 0.00000 obj. -4.82199e+10 iterations 429 Pass 2: (0.15 seconds) suminf. 0.00000 obj. -4.82199e+10 iterations 0 Pass 3: (0.16 seconds) suminf. 0.00000 obj. -4.82199e+10 iterations 11 Pass 4: (0.18 seconds) suminf. 0.00000 obj. -4.82199e+10 iterations 2 Pass 5: (0.19 seconds) suminf. 0.00000 obj. -4.82199e+10 iterations 6 Pass 6: (0.20 seconds) suminf. 0.00000 obj. -4.82199e+10 iterations 5 Pass 7: (0.21 seconds) suminf. 0.00000 obj. -4.82199e+10 iterations 2 Pass 8: (0.37 seconds) suminf. 0.83885 obj. -4.81654e+10 iterations 1106 Pass 9: (0.38 seconds) suminf. 0.00000 obj. -4.81405e+10 iterations 51 Pass 10: (0.39 seconds) suminf. 0.00000 obj. -4.81405e+10 iterations 0 Pass 11: (0.44 seconds) suminf. 1.14732 obj. -4.81484e+10 iterations 369 Pass 12: (0.47 seconds) suminf. 0.00000 obj. -4.81194e+10 iterations 305 Pass 13: (0.48 seconds) suminf. 0.00000 obj. -4.81194e+10 iterations 0 Pass 14: (0.50 seconds) suminf. 0.14205 obj. -4.81198e+10 iterations 39 Pass 15: (0.50 seconds) suminf. 0.00000 obj. -4.81197e+10 iterations 24 Pass 16: (0.52 seconds) suminf. 0.00000 obj. -4.81197e+10 iterations 0 Pass 17: (0.52 seconds) suminf. 0.00000 obj. -4.81197e+10 iterations 1 Pass 18: (0.55 seconds) suminf. 0.07129 obj. -4.8125e+10 iterations 218 Pass 19: (0.56 seconds) suminf. 0.00000 obj. -4.81239e+10 iterations 10 Pass 20: (0.57 seconds) suminf. 0.00000 obj. -4.81239e+10 iterations 0 Before mini branch and bound, 57 integers at bound fixed and 2232 continuous Full problem 3345 rows 3262 columns, reduced to 986 rows 838 columns Mini branch and bound improved solution from 1.79769e+308 to -4.83192e+10 (1.16 seconds) Freeing continuous variables gives a solution of -4.85868e+10 Round again with cutoff of -4.86454e+10 Pass 20: (1.35 seconds) suminf. 0.34828 obj. -4.86454e+10 iterations 432 Pass 21: (1.46 seconds) suminf. 0.26556 obj. -4.86454e+10 iterations 326 Pass 22: (1.47 seconds) suminf. 0.43802 obj. -4.86454e+10 iterations 15 Pass 23: (1.50 seconds) suminf. 0.26560 obj. -4.86454e+10 iterations 77 Pass 24: (1.60 seconds) suminf. 0.64335 obj. -4.86454e+10 iterations 321 Pass 25: (1.72 seconds) suminf. 1.17317 obj. -4.86454e+10 iterations 443 Pass 26: (1.84 seconds) suminf. 0.30487 obj. -4.86454e+10 iterations 478 Pass 27: (1.93 seconds) suminf. 0.41475 obj. -4.86454e+10 iterations 449 Pass 28: (2.01 seconds) suminf. 0.86542 obj. -4.86454e+10 iterations 357 Pass 29: (2.09 seconds) suminf. 0.39101 obj. -4.86454e+10 iterations 284 Pass 30: (2.11 seconds) suminf. 0.49934 obj. -4.86454e+10 iterations 60 Pass 31: (2.14 seconds) suminf. 0.63164 obj. -4.86454e+10 iterations 106 Pass 32: (2.18 seconds) suminf. 0.39653 obj. -4.86454e+10 iterations 135 Pass 33: (2.33 seconds) suminf. 0.23895 obj. -4.86454e+10 iterations 602 Pass 34: (2.34 seconds) suminf. 0.25451 obj. -4.86454e+10 iterations 4 Pass 35: (2.36 seconds) suminf. 0.23895 obj. -4.86454e+10 iterations 16 Pass 36: (2.38 seconds) suminf. 0.25810 obj. -4.86454e+10 iterations 33 Pass 37: (2.40 seconds) suminf. 0.29129 obj. -4.86454e+10 iterations 12 Pass 38: (2.42 seconds) suminf. 0.29129 obj. -4.86454e+10 iterations 5 Pass 39: (2.44 seconds) suminf. 0.37789 obj. -4.86454e+10 iterations 63 No solution found this major pass Before mini branch and bound, 53 integers at bound fixed and 2067 continuous Full problem 3345 rows 3262 columns, reduced to 1163 rows 1041 columns Mini branch and bound did not improve solution (2.83 seconds) After 2.83 seconds - Feasibility pump exiting with objective of -4.85868e+10 - took 2.82 seconds Integer solution of -4.85872e+10 found by feasibility pump after 0 iterations and 0 nodes (2.83 seconds) Full problem 3345 rows 3262 columns, reduced to 1028 rows 1019 columns 2 added rows had average density of 47 At root node, 2 cuts changed objective from -4.91729e+10 to -4.86009e+10 in 10 passes Cut generator 0 (Probing) - 28 row cuts (1 active), 45 column cuts in 0.036 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.028 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 16 row cuts (1 active), 0 column cuts in 0.056 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 (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.044 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 37 row cuts (0 active), 0 column cuts in 0.032 seconds - new frequency is -100 Thread 0 used 0 times, waiting to start 0.00865618, 0 cpu time, 0 locks, 0 locked, 0 waiting for locks Thread 1 used 0 times, waiting to start 0.000228772, 0 cpu time, 0 locks, 0 locked, 0 waiting for locks Main thread 0 waiting for threads, 1 locks, 1.14549e-05 locked, 2.20304e-06 waiting for locks Search completed - best objective -48587177297.58147, took 794 iterations and 0 nodes (3.43 seconds) Strong branching done 6 times (33 iterations), fathomed 3 nodes and fixed 0 variables Maximum depth 0, 13 variables fixed on reduced cost Cuts at root node changed objective from -4.91729e+10 to -4.85391e+10 Probing was tried 30 times and created 84 cuts of which 3 were active after adding rounds of cuts (0.108 seconds) Gomory was tried 27 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.084 seconds) Knapsack was tried 30 times and created 48 cuts of which 3 were active after adding rounds of cuts (0.168 seconds) Clique was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 30 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.048 seconds) FlowCover was tried 30 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.132 seconds) TwoMirCuts was tried 27 times and created 111 cuts of which 0 were active after adding rounds of cuts (0.096 seconds) 794 bounds tightened after postprocessing Result - Finished objective -48587177297.58147 after 0 nodes and 794 iterations - took 7.79 seconds (total time 8.86) Total time 10.53 Solved to optimality. wallclocktime: 10.7531 used seconds: 10.56 MIP solution: -4.85871773e+10 (0 nodes, 10.57 seconds) Best possible: -4.85871773e+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 07/18/08 14:25:23 elapsed 0:00:11.863