--- Job neos5 Start 08/22/08 00:41:13 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 --- 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.154 --- 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 COINCBC: elapsed 0:00:00.689 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest 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 Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is -4.96442e+10 - 0.76 seconds 0 fixed, 35 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 3338 rows, 3271 columns (72 integer) and 11136 elements Pass 1: (0.11 seconds) suminf. 0.00000 obj. -4.8218e+10 iterations 508 Pass 2: (0.12 seconds) suminf. 0.00000 obj. -4.8218e+10 iterations 0 Pass 3: (0.13 seconds) suminf. 0.00000 obj. -4.8218e+10 iterations 3 Pass 4: (0.13 seconds) suminf. 0.00000 obj. -4.8218e+10 iterations 5 Pass 5: (0.14 seconds) suminf. 0.00000 obj. -4.8218e+10 iterations 7 Pass 6: (0.16 seconds) suminf. 0.00000 obj. -4.8218e+10 iterations 4 Pass 7: (0.16 seconds) suminf. 0.00000 obj. -4.8218e+10 iterations 7 Pass 8: (0.19 seconds) suminf. 0.18824 obj. -4.82182e+10 iterations 164 Pass 9: (0.20 seconds) suminf. 0.00000 obj. -4.82183e+10 iterations 13 Pass 10: (0.21 seconds) suminf. 0.00000 obj. -4.82183e+10 iterations 0 Pass 11: (0.26 seconds) suminf. 1.09728 obj. -4.81818e+10 iterations 463 Pass 12: (0.28 seconds) suminf. 0.00000 obj. -4.81722e+10 iterations 169 Pass 13: (0.29 seconds) suminf. 0.00000 obj. -4.81722e+10 iterations 0 Pass 14: (0.31 seconds) suminf. 0.00000 obj. -4.81724e+10 iterations 129 Pass 15: (0.32 seconds) suminf. 0.00000 obj. -4.81724e+10 iterations 3 Pass 16: (0.33 seconds) suminf. 0.00000 obj. -4.81724e+10 iterations 0 Pass 17: (0.35 seconds) suminf. 0.10447 obj. -4.81866e+10 iterations 165 Pass 18: (0.36 seconds) suminf. 0.00000 obj. -4.81865e+10 iterations 20 Pass 19: (0.37 seconds) suminf. 0.00000 obj. -4.81865e+10 iterations 0 Pass 20: (0.42 seconds) suminf. 0.00000 obj. -4.81545e+10 iterations 412 Before mini branch and bound, 57 integers at bound fixed and 2225 continuous Full problem 3338 rows 3271 columns, reduced to 926 rows 819 columns Mini branch and bound improved solution from 1.79769e+308 to -4.83207e+10 (0.71 seconds) Freeing continuous variables gives a solution of -4.83481e+10 Round again with cutoff of -4.84306e+10 Pass 20: (0.85 seconds) suminf. 0.18718 obj. -4.84306e+10 iterations 418 Pass 21: (0.94 seconds) suminf. 0.00000 obj. -4.84306e+10 iterations 394 Pass 22: (0.96 seconds) suminf. 0.00000 obj. -4.84306e+10 iterations 1 Pass 23: (0.97 seconds) suminf. 0.29129 obj. -4.84306e+10 iterations 33 Pass 24: (1.84 seconds) suminf. 0.91155 obj. -4.84306e+10 iterations 3473 Pass 25: (2.08 seconds) suminf. 0.40168 obj. -4.84306e+10 iterations 1836 Pass 26: (2.10 seconds) suminf. 0.42098 obj. -4.84306e+10 iterations 43 Pass 27: (2.12 seconds) suminf. 0.39576 obj. -4.84306e+10 iterations 61 Pass 28: (2.16 seconds) suminf. 1.09385 obj. -4.84306e+10 iterations 180 Pass 29: (2.18 seconds) suminf. 0.89957 obj. -4.84306e+10 iterations 18 Pass 30: (2.20 seconds) suminf. 1.47508 obj. -4.84306e+10 iterations 23 Pass 31: (2.81 seconds) suminf. 1.40051 obj. -4.84306e+10 iterations 2097 Pass 32: (2.92 seconds) suminf. 0.81077 obj. -4.84306e+10 iterations 410 Pass 33: (3.12 seconds) suminf. 0.15422 obj. -4.84306e+10 iterations 663 Pass 34: (3.90 seconds) suminf. 0.78532 obj. -4.84306e+10 iterations 4711 Pass 35: (4.88 seconds) suminf. 1.86405 obj. -4.84306e+10 iterations 4060 Pass 36: (5.05 seconds) suminf. 0.62297 obj. -4.84306e+10 iterations 769 Pass 37: (5.10 seconds) suminf. 1.03430 obj. -4.84306e+10 iterations 236 Pass 38: (5.16 seconds) suminf. 0.62297 obj. -4.84306e+10 iterations 242 Pass 39: (5.24 seconds) suminf. 1.27804 obj. -4.84306e+10 iterations 368 No solution found this major pass Before mini branch and bound, 42 integers at bound fixed and 1745 continuous Full problem 3338 rows 3271 columns, reduced to 1557 rows 1446 columns Mini branch and bound improved solution from -4.83481e+10 to -4.86022e+10 (6.82 seconds) Freeing continuous variables gives a solution of -4.86034e+10 After 6.84 seconds - Feasibility pump exiting with objective of -4.86034e+10 - took 6.84 seconds Integer solution of -4.86034e+10 found by feasibility pump after 0 iterations and 0 nodes (6.85 seconds) Full problem 3338 rows 3271 columns, reduced to 1038 rows 1033 columns 2 added rows had average density of 18 At root node, 13 cuts changed objective from -4.91729e+10 to -4.85091e+10 in 2 passes Cut generator 0 (Probing) - 2 row cuts (10 active), 18 column cuts in 0.016 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 2 row cuts (0 active), 0 column cuts in 0.012 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.008 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) - 12 row cuts (2 active), 0 column cuts in 0.008 seconds - new frequency is -100 Search completed - best objective -48603440750.59011, took 450 iterations and 0 nodes (7.04 seconds) Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -4.91729e+10 to -4.85091e+10 Probing was tried 2 times and created 2 cuts of which 10 were active after adding rounds of cuts (0.016 seconds) Gomory was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Knapsack was tried 2 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Clique was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts (0.008 seconds) FlowCover was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) TwoMirCuts was tried 2 times and created 12 cuts of which 2 were active after adding rounds of cuts (0.008 seconds) 744 bounds tightened after postprocessing Result - Finished objective -48603440750.59011 after 0 nodes and 450 iterations - took 8.98 seconds (total time 9.77) Total time 10.88 Solved to optimality. MIP solution: -4.860344075e+10 (0 nodes, 10.92 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 08/22/08 00:41:25 elapsed 0:00:12.002