--- Job neos3 Start 08/24/08 04:33:40 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 --- neos3.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/neos3.gdx --- neos3.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.020 --- neos3.gms(123) 4 Mb --- Generating MIP model m --- neos3.gms(124) 4 Mb --- 1,443 rows 2,748 columns 9,586 non-zeroes --- 1,360 discrete-columns --- neos3.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.062 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 2747 columns and 1442 rows. 1360 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is -6571.63 - 0.02 seconds Optimal - objective value -6571.63 0 fixed, 0 tightened bounds, 82 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 54 strengthened rows, 0 substitutions 17 SOS with 1360 members processed model has 1437 rows, 2742 columns (1360 integer) and 8862 elements Pass 1: suminf. 4.15235 (26) obj. -4693.24 iterations 962 Pass 2: suminf. 4.15235 (26) obj. -4693.24 iterations 0 Pass 3: suminf. 6.59746 (32) obj. -1367.49 iterations 52 Pass 4: suminf. 4.25069 (26) obj. -3853.38 iterations 70 Pass 5: suminf. 4.25069 (26) obj. -3853.38 iterations 0 Pass 6: suminf. 6.42183 (33) obj. -1318.62 iterations 131 Pass 7: suminf. 3.69182 (28) obj. -1478.99 iterations 239 Pass 8: suminf. 3.69182 (28) obj. -1478.99 iterations 0 Pass 9: suminf. 5.37882 (30) obj. -1059.51 iterations 107 Pass 10: suminf. 3.83001 (28) obj. -1287.58 iterations 136 Pass 11: suminf. 3.83001 (28) obj. -1287.58 iterations 0 Pass 12: suminf. 6.65124 (30) obj. -965.431 iterations 231 Pass 13: suminf. 3.65647 (24) obj. -1366.85 iterations 135 Pass 14: suminf. 3.65647 (24) obj. -1366.85 iterations 0 Pass 15: suminf. 5.14486 (26) obj. -2305.49 iterations 43 Pass 16: suminf. 3.95153 (22) obj. -2227.69 iterations 141 Pass 17: suminf. 3.95153 (22) obj. -2227.69 iterations 0 Pass 18: suminf. 7.14634 (26) obj. -2203.19 iterations 50 Pass 19: suminf. 4.99922 (24) obj. -2227.23 iterations 287 Pass 20: suminf. 4.99922 (24) obj. -2227.23 iterations 0 No solution found this major pass Before mini branch and bound, 1227 integers at bound fixed and 1171 continuous Full problem 1437 rows 2742 columns, reduced to 240 rows 318 columns Mini branch and bound did not improve solution (0.27 seconds) Full problem 1438 rows 2742 columns, reduced to 1438 rows 2742 columns - too large After 0.34 seconds - Feasibility pump exiting - took 0.33 seconds 34 added rows had average density of 624.353 At root node, 34 cuts changed objective from -6158.21 to -5439.94 in 22 passes Cut generator 0 (Probing) - 11 row cuts, 0 column cuts (10 active) in 0.612 seconds - new frequency is 2 Cut generator 1 (Gomory) - 518 row cuts, 0 column cuts (24 active) in 0.160 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.040 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.024 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 1.184 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 141 row cuts, 0 column cuts (0 active) in 0.084 seconds - new frequency is -100 Optimal - objective value -5439.94 Optimal - objective value -5439.94 After 0 nodes, 1 on tree, 1e+50 best solution, best possible -5439.94 (3.61 seconds) After 100 nodes, 31 on tree, 898.416 best solution, best possible -1184.11 (5.63 seconds) Integer solution of 443.128 found after 11881 iterations and 174 nodes (6.73 seconds) After 200 nodes, 40 on tree, 443.128 best solution, best possible -388.55 (7.03 seconds) Integer solution of 410.467 found after 13349 iterations and 256 nodes (7.75 seconds) Full problem 1437 rows 2742 columns, reduced to 72 rows 62 columns Full problem 1437 rows 2742 columns, reduced to 74 rows 65 columns Full problem 1437 rows 2742 columns, reduced to 83 rows 80 columns After 300 nodes, 47 on tree, 403.524 best solution, best possible -153.973 (8.90 seconds) Integer solution of 400.983 found after 14129 iterations and 323 nodes (9.12 seconds) Full problem 1437 rows 2742 columns, reduced to 84 rows 85 columns After 400 nodes, 78 on tree, 400.983 best solution, best possible 182.916 (10.65 seconds) After 500 nodes, 103 on tree, 400.983 best solution, best possible 272.501 (11.84 seconds) After 600 nodes, 138 on tree, 400.983 best solution, best possible 314.858 (13.24 seconds) After 700 nodes, 174 on tree, 400.983 best solution, best possible 331.817 (14.74 seconds) After 800 nodes, 187 on tree, 400.983 best solution, best possible 345.228 (15.91 seconds) After 900 nodes, 213 on tree, 400.983 best solution, best possible 354.691 (17.03 seconds) After 1000 nodes, 241 on tree, 400.983 best solution, best possible 361.209 (18.31 seconds) After 1100 nodes, 277 on tree, 400.983 best solution, best possible 364.648 (19.60 seconds) After 1200 nodes, 322 on tree, 400.983 best solution, best possible 367.009 (21.02 seconds) After 1300 nodes, 370 on tree, 400.983 best solution, best possible 368.298 (22.39 seconds) After 1400 nodes, 411 on tree, 400.983 best solution, best possible 368.843 (23.64 seconds) After 1500 nodes, 425 on tree, 400.983 best solution, best possible 368.843 (24.49 seconds) Integer solution of 370.75 found after 26610 iterations and 1519 nodes (24.69 seconds) Full problem 1437 rows 2742 columns, reduced to 135 rows 135 columns Integer solution of 369.404 found by combine solutions after 26635 iterations and 1520 nodes (26.00 seconds) Integer solution of 368.843 found after 26722 iterations and 1527 nodes (26.08 seconds) Search completed - best objective 368.8427509999783, took 26722 iterations and 1527 nodes (26.09 seconds) Strong branching done 9136 times (76317 iterations), fathomed 56 nodes and fixed 76 variables Maximum depth 42, 1129 variables fixed on reduced cost Cuts at root node changed objective from -6158.21 to -5439.94 Probing was tried 745 times and created 266 cuts of which 185 were active after adding rounds of cuts (1.708 seconds) Gomory was tried 934 times and created 528 cuts of which 31 were active after adding rounds of cuts (1.396 seconds) Knapsack was tried 22 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) Clique was tried 22 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) MixedIntegerRounding2 was tried 22 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) FlowCover was tried 22 times and created 0 cuts of which 0 were active after adding rounds of cuts (1.184 seconds) TwoMirCuts was tried 22 times and created 141 cuts of which 0 were active after adding rounds of cuts (0.084 seconds) implication was tried 821 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 368.8427509999783 after 1527 nodes and 26722 iterations - took 26.29 seconds (total time 26.31) Total time 26.41 Solved to optimality. MIP solution: 368.842751 (1527 nodes, 26.42 seconds) Best possible: 368.842751 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- neos3.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job neos3.gms Stop 08/24/08 04:34:06 elapsed 0:00:26.760