--- Job neos4 Start 08/22/08 00:40:58 GAMS Rev 228 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.163 --- 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.734 GAMS/CoinCbc 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.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is -5.05064e+10 - 0.87 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 3348 rows, 3271 columns (72 integer) and 11200 elements Pass 1: (0.10 seconds) suminf. 0.00000 obj. -4.82214e+10 iterations 398 Pass 2: (0.10 seconds) suminf. 0.00000 obj. -4.82214e+10 iterations 0 Pass 3: (0.12 seconds) suminf. 0.00000 obj. -4.82214e+10 iterations 8 Pass 4: (0.13 seconds) suminf. 0.00000 obj. -4.82214e+10 iterations 3 Pass 5: (0.14 seconds) suminf. 0.00000 obj. -4.82214e+10 iterations 8 Pass 6: (0.15 seconds) suminf. 0.00000 obj. -4.82214e+10 iterations 10 Pass 7: (0.16 seconds) suminf. 0.00000 obj. -4.82214e+10 iterations 9 Pass 8: (0.22 seconds) suminf. 0.08480 obj. -4.82303e+10 iterations 266 Pass 9: (0.23 seconds) suminf. 0.00000 obj. -4.82225e+10 iterations 163 Pass 10: (0.24 seconds) suminf. 0.00000 obj. -4.82225e+10 iterations 0 Pass 11: (0.30 seconds) suminf. 0.00000 obj. -4.81941e+10 iterations 502 Pass 12: (0.31 seconds) suminf. 0.00000 obj. -4.81941e+10 iterations 13 Pass 13: (0.32 seconds) suminf. 0.00000 obj. -4.81941e+10 iterations 0 Pass 14: (0.34 seconds) suminf. 0.00000 obj. -4.81944e+10 iterations 105 Pass 15: (0.35 seconds) suminf. 0.00000 obj. -4.81944e+10 iterations 2 Pass 16: (0.36 seconds) suminf. 0.00000 obj. -4.81944e+10 iterations 0 Pass 17: (0.37 seconds) suminf. 0.00000 obj. -4.81944e+10 iterations 16 Pass 18: (0.39 seconds) suminf. 0.15046 obj. -4.82137e+10 iterations 212 Pass 19: (0.40 seconds) suminf. 0.00000 obj. -4.82121e+10 iterations 11 Pass 20: (0.41 seconds) suminf. 0.00000 obj. -4.82121e+10 iterations 0 Before mini branch and bound, 61 integers at bound fixed and 2301 continuous Full problem 3348 rows 3271 columns, reduced to 865 rows 738 columns Mini branch and bound improved solution from 1.79769e+308 to -4.83204e+10 (0.64 seconds) Freeing continuous variables gives a solution of -4.83481e+10 Round again with cutoff of -4.84306e+10 Pass 20: (0.77 seconds) suminf. 0.18643 obj. -4.84306e+10 iterations 372 Pass 21: (1.45 seconds) suminf. 0.55578 obj. -4.84306e+10 iterations 2449 Pass 22: (1.81 seconds) suminf. 0.69261 obj. -4.84306e+10 iterations 1795 Pass 23: (1.84 seconds) suminf. 0.96079 obj. -4.84306e+10 iterations 134 Pass 24: (1.88 seconds) suminf. 0.67924 obj. -4.84306e+10 iterations 125 Pass 25: (1.91 seconds) suminf. 0.99755 obj. -4.84306e+10 iterations 130 Pass 26: (1.96 seconds) suminf. 1.40179 obj. -4.84306e+10 iterations 273 Pass 27: (2.06 seconds) suminf. 0.94539 obj. -4.84306e+10 iterations 569 Pass 28: (2.69 seconds) suminf. 1.90997 obj. -4.84306e+10 iterations 2580 Pass 29: (2.90 seconds) suminf. 0.89565 obj. -4.84306e+10 iterations 726 Pass 30: (2.94 seconds) suminf. 1.00000 obj. -4.84306e+10 iterations 138 Pass 31: (4.02 seconds) suminf. 1.11577 obj. -4.84306e+10 iterations 4366 Pass 32: (4.04 seconds) suminf. 0.43138 obj. -4.84306e+10 iterations 66 Pass 33: (4.43 seconds) suminf. 0.66726 obj. -4.84306e+10 iterations 2161 Pass 34: (4.48 seconds) suminf. 0.53946 obj. -4.84306e+10 iterations 250 Pass 35: (4.50 seconds) suminf. 0.57588 obj. -4.84306e+10 iterations 6 Pass 36: (4.52 seconds) suminf. 0.53946 obj. -4.84306e+10 iterations 14 Pass 37: (4.54 seconds) suminf. 0.68102 obj. -4.84306e+10 iterations 15 Pass 38: (4.55 seconds) suminf. 0.81153 obj. -4.84306e+10 iterations 44 Pass 39: (5.65 seconds) suminf. 1.35100 obj. -4.84306e+10 iterations 4229 No solution found this major pass Before mini branch and bound, 40 integers at bound fixed and 1624 continuous Full problem 3348 rows 3271 columns, reduced to 1688 rows 1589 columns Mini branch and bound improved solution from -4.83481e+10 to -4.86019e+10 (7.36 seconds) Freeing continuous variables gives a solution of -4.86034e+10 After 7.38 seconds - Feasibility pump exiting with objective of -4.86034e+10 - took 7.37 seconds Integer solution of -4.86034e+10 found by feasibility pump after 0 iterations and 0 nodes (7.38 seconds) Full problem 3348 rows 3271 columns, reduced to 1038 rows 1033 columns 4 added rows had average density of 13 At root node, 4 cuts changed objective from -4.91729e+10 to -4.87002e+10 in 8 passes Cut generator 0 (Probing) - 2 row cuts (1 active), 8 column cuts in 0.040 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 13 row cuts (1 active), 0 column cuts in 0.040 seconds - new frequency is 1 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.008 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.032 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 40 row cuts (1 active), 0 column cuts in 0.028 seconds - new frequency is -100 Search completed - best objective -48603440750.59011, took 1023 iterations and 0 nodes (8.25 seconds) Strong branching done 46 times (1266 iterations), fathomed 1 nodes and fixed 6 variables Maximum depth 0, 13 variables fixed on reduced cost Cuts at root node changed objective from -4.91729e+10 to -4.85826e+10 Probing was tried 8 times and created 2 cuts of which 1 were active after adding rounds of cuts (0.040 seconds) Gomory was tried 7 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) Knapsack was tried 8 times and created 13 cuts of which 1 were active after adding rounds of cuts (0.040 seconds) Clique was tried 8 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 8 times and created 1 cuts of which 1 were active after adding rounds of cuts (0.008 seconds) FlowCover was tried 8 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) TwoMirCuts was tried 7 times and created 40 cuts of which 1 were active after adding rounds of cuts (0.028 seconds) 802 bounds tightened after postprocessing Result - Finished objective -48603440750.59011 after 0 nodes and 1023 iterations - took 12.08 seconds (total time 12.97) Total time 14.46 Solved to optimality. MIP solution: -4.860344075e+10 (0 nodes, 14.5 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/22/08 00:41:13 elapsed 0:00:15.765