--- Job neos5 Start 07/18/08 14:25:23 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 --- neos5.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/neos5.gdx --- neos5.gms(148) 10 Mb --- Starting execution: elapsed 0:00:00.249 --- neos5.gms(123) 10 Mb --- Generating MIP model m --- neos5.gms(124) 17 Mb --- 36,703 rows 21,125 columns 109,069 non-zeroes --- 17,136 discrete-columns --- neos5.gms(124) 17 Mb --- Executing Cbc: elapsed 0:00:00.831 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: 21124 columns and 36702 rows. 17136 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 -4.96442e+10 - 0.89 seconds 0 fixed, 34 tightened bounds, 2217 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 3335 rows, 3262 columns (72 integer) and 11115 elements Pass 1: (0.14 seconds) suminf. 0.00000 obj. -4.82173e+10 iterations 549 Pass 2: (0.15 seconds) suminf. 0.00000 obj. -4.82173e+10 iterations 0 Pass 3: (0.16 seconds) suminf. 0.00000 obj. -4.82173e+10 iterations 1 Pass 4: (0.18 seconds) suminf. 0.00000 obj. -4.82173e+10 iterations 4 Pass 5: (0.19 seconds) suminf. 0.00000 obj. -4.82173e+10 iterations 5 Pass 6: (0.20 seconds) suminf. 0.00000 obj. -4.82173e+10 iterations 10 Pass 7: (0.21 seconds) suminf. 0.00000 obj. -4.82173e+10 iterations 9 Pass 8: (0.24 seconds) suminf. 0.00000 obj. -4.82176e+10 iterations 153 Pass 9: (0.26 seconds) suminf. 0.00000 obj. -4.82176e+10 iterations 8 Pass 10: (0.26 seconds) suminf. 0.00000 obj. -4.82176e+10 iterations 0 Pass 11: (0.30 seconds) suminf. 0.00000 obj. -4.8189e+10 iterations 343 Pass 12: (0.31 seconds) suminf. 0.00000 obj. -4.8189e+10 iterations 8 Pass 13: (0.32 seconds) suminf. 0.00000 obj. -4.8189e+10 iterations 0 Pass 14: (0.35 seconds) suminf. 0.89873 obj. -4.82041e+10 iterations 202 Pass 15: (0.37 seconds) suminf. 0.00000 obj. -4.81897e+10 iterations 79 Pass 16: (0.38 seconds) suminf. 0.00000 obj. -4.81897e+10 iterations 0 Pass 17: (0.39 seconds) suminf. 0.00000 obj. -4.81897e+10 iterations 0 Pass 18: (0.42 seconds) suminf. 0.08070 obj. -4.82155e+10 iterations 300 Pass 19: (0.43 seconds) suminf. 0.00000 obj. -4.82158e+10 iterations 5 Pass 20: (0.44 seconds) suminf. 0.00000 obj. -4.82158e+10 iterations 0 Before mini branch and bound, 61 integers at bound fixed and 2299 continuous Full problem 3335 rows 3262 columns, reduced to 849 rows 719 columns Mini branch and bound improved solution from 1.79769e+308 to -4.83282e+10 (0.76 seconds) Freeing continuous variables gives a solution of -4.85189e+10 Round again with cutoff of -4.85843e+10 Pass 20: (1.08 seconds) suminf. 0.33978 obj. -4.85843e+10 iterations 854 Pass 21: (1.22 seconds) suminf. 0.37193 obj. -4.85843e+10 iterations 442 Pass 22: (1.30 seconds) suminf. 0.58379 obj. -4.85843e+10 iterations 345 Pass 23: (1.32 seconds) suminf. 0.37204 obj. -4.85843e+10 iterations 93 Pass 24: (1.43 seconds) suminf. 1.08490 obj. -4.85843e+10 iterations 414 Pass 25: (1.51 seconds) suminf. 0.44963 obj. -4.85843e+10 iterations 245 Pass 26: (1.53 seconds) suminf. 0.47267 obj. -4.85843e+10 iterations 10 Pass 27: (1.55 seconds) suminf. 0.44992 obj. -4.85843e+10 iterations 41 Pass 28: (1.94 seconds) suminf. 0.43913 obj. -4.85843e+10 iterations 1953 Pass 29: (2.58 seconds) suminf. 1.00000 obj. -4.85843e+10 iterations 2447 Pass 30: (2.67 seconds) suminf. 0.89565 obj. -4.85843e+10 iterations 261 Pass 31: (2.70 seconds) suminf. 1.00000 obj. -4.85843e+10 iterations 46 Pass 32: (2.71 seconds) suminf. 1.00000 obj. -4.85843e+10 iterations 1 Pass 33: (2.74 seconds) suminf. 1.00000 obj. -4.85843e+10 iterations 49 Pass 34: (3.80 seconds) suminf. 1.10280 obj. -4.85843e+10 iterations 4033 Pass 35: (3.95 seconds) suminf. 0.54737 obj. -4.85843e+10 iterations 552 Pass 36: (4.09 seconds) suminf. 0.57196 obj. -4.85843e+10 iterations 518 Pass 37: (4.48 seconds) suminf. 0.55697 obj. -4.85843e+10 iterations 1588 Pass 38: (4.53 seconds) suminf. 0.75602 obj. -4.85843e+10 iterations 226 Pass 39: (4.57 seconds) suminf. 0.53210 obj. -4.85843e+10 iterations 134 No solution found this major pass Before mini branch and bound, 55 integers at bound fixed and 1862 continuous Full problem 3335 rows 3262 columns, reduced to 1417 rows 1331 columns Mini branch and bound improved solution from -4.85189e+10 to -4.86018e+10 (5.14 seconds) Freeing continuous variables gives a solution of -4.86034e+10 After 5.17 seconds - Feasibility pump exiting with objective of -4.86034e+10 - took 5.16 seconds Integer solution of -4.86034e+10 found by feasibility pump after 0 iterations and 0 nodes (5.17 seconds) Full problem 3335 rows 3262 columns, reduced to 1035 rows 1024 columns 14 added rows had average density of 107 At root node, 14 cuts changed objective from -4.91729e+10 to -4.91462e+10 in 7 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.060 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 8 row cuts (2 active), 0 column cuts in 0.040 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 1 row cuts (1 active), 0 column cuts in 0.028 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.028 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 48 row cuts (11 active), 0 column cuts in 0.028 seconds - new frequency is -100 After 0 nodes, 1 on tree, -4.86034e+10 best solution, best possible -4.91462e+10 (6.00 seconds) Thread 0 used 46 times, waiting to start 0.213396, 288 locks, 0.0169862 locked, 0.00160355 waiting for locks Thread 1 used 46 times, waiting to start 2.33254, 236 locks, 0.0180725 locked, 0.00290952 waiting for locks Main thread 5.98394 waiting for threads, 202 locks, 0.000400348 locked, 0.00211402 waiting for locks Search completed - best objective -48603440750.59011, took 14608 iterations and 92 nodes (15.35 seconds) Strong branching done 384 times (22137 iterations), fathomed 5 nodes and fixed 34 variables Maximum depth 24, 239 variables fixed on reduced cost Cuts at root node changed objective from -4.91729e+10 to -4.91462e+10 Probing was tried 26 times and created 1 cuts of which 1 were active after adding rounds of cuts (0.196 seconds) Gomory was tried 21 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.060 seconds) Knapsack was tried 21 times and created 24 cuts of which 6 were active after adding rounds of cuts (0.120 seconds) Clique was tried 21 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 21 times and created 3 cuts of which 3 were active after adding rounds of cuts (0.084 seconds) FlowCover was tried 21 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.084 seconds) TwoMirCuts was tried 21 times and created 144 cuts of which 33 were active after adding rounds of cuts (0.084 seconds) 736 bounds tightened after postprocessing Result - Finished objective -48603440750.59011 after 92 nodes and 14608 iterations - took 18.19 seconds (total time 19.10) Total time 20.39 Solved to optimality. wallclocktime: 17.2262 used seconds: 20.43 MIP solution: -4.860344075e+10 (92 nodes, 20.43 seconds) Best possible: -4.860344075e+10 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- neos5.gms(124) 0 Mb --- Reading solution for model m --- neos5.gms(124) 13 Mb *** Status: Normal completion --- Job neos5.gms Stop 07/18/08 14:25:41 elapsed 0:00:18.271