--- Job neos2 Start 08/24/08 04:33:30 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 --- neos2.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/neos2.gdx --- neos2.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.017 --- neos2.gms(123) 4 Mb --- Generating MIP model m --- neos2.gms(124) 4 Mb --- 1,104 rows 2,102 columns 7,331 non-zeroes --- 1,040 discrete-columns --- Executing Cbc: elapsed 0:00:00.050 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 2101 columns and 1103 rows. 1040 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 -4717.67 - 0.02 seconds Optimal - objective value -4717.67 0 fixed, 0 tightened bounds, 76 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 54 strengthened rows, 0 substitutions 13 SOS with 1040 members processed model has 1099 rows, 2097 columns (1040 integer) and 6767 elements Pass 1: suminf. 3.63075 (18) obj. -4025.23 iterations 723 Pass 2: suminf. 3.63075 (18) obj. -4025.23 iterations 0 Pass 3: suminf. 4.65406 (19) obj. -3856.18 iterations 28 Pass 4: suminf. 3.44944 (18) obj. -3954.96 iterations 31 Pass 5: suminf. 3.44944 (18) obj. -3954.96 iterations 0 Pass 6: suminf. 4.23340 (19) obj. -2589.85 iterations 48 Pass 7: suminf. 3.10078 (18) obj. -2667.54 iterations 76 Pass 8: suminf. 3.10078 (18) obj. -2667.54 iterations 0 Pass 9: suminf. 3.68164 (19) obj. -1909.05 iterations 31 Pass 10: suminf. 3.26348 (18) obj. -2616.08 iterations 181 Pass 11: suminf. 3.26348 (18) obj. -2616.08 iterations 0 Pass 12: suminf. 4.91263 (23) obj. -933.802 iterations 68 Pass 13: suminf. 2.99349 (18) obj. -2032.65 iterations 163 Pass 14: suminf. 2.99349 (18) obj. -2032.65 iterations 0 Pass 15: suminf. 4.00926 (20) obj. -930.437 iterations 33 Pass 16: suminf. 3.35239 (20) obj. -243.145 iterations 46 Pass 17: suminf. 3.35239 (20) obj. -243.145 iterations 0 Pass 18: suminf. 6.05396 (26) obj. 503.562 iterations 54 Pass 19: suminf. 3.41239 (20) obj. -1135.27 iterations 144 Pass 20: suminf. 3.41239 (20) obj. -1135.27 iterations 0 No solution found this major pass Before mini branch and bound, 937 integers at bound fixed and 902 continuous Full problem 1099 rows 2097 columns, reduced to 184 rows 237 columns Mini branch and bound did not improve solution (0.18 seconds) Full problem 1100 rows 2097 columns, reduced to 1100 rows 2097 columns - too large After 0.21 seconds - Feasibility pump exiting - took 0.20 seconds 31 added rows had average density of 623.871 At root node, 31 cuts changed objective from -4407.1 to -3846.22 in 26 passes Cut generator 0 (Probing) - 13 row cuts, 0 column cuts (2 active) in 0.532 seconds - new frequency is 2 Cut generator 1 (Gomory) - 672 row cuts, 0 column cuts (19 active) in 0.156 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.028 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.044 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.872 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 214 row cuts, 0 column cuts (0 active) in 0.072 seconds - new frequency is -100 Optimal - objective value -3846.22 Optimal - objective value -3846.22 After 0 nodes, 1 on tree, 1e+50 best solution, best possible -3846.22 (2.96 seconds) After 100 nodes, 24 on tree, 1047.68 best solution, best possible -1248.9 (4.93 seconds) Integer solution of 548.76 found after 10064 iterations and 121 nodes (5.17 seconds) Integer solution of 520.25 found after 11138 iterations and 160 nodes (5.66 seconds) Full problem 1099 rows 2097 columns, reduced to 55 rows 47 columns Integer solution of 514.131 found by combine solutions after 11149 iterations and 161 nodes (5.70 seconds) After 200 nodes, 26 on tree, 514.131 best solution, best possible 23.9445 (6.14 seconds) Integer solution of 512.71 found after 12492 iterations and 243 nodes (6.52 seconds) Full problem 1099 rows 2097 columns, reduced to 75 rows 67 columns Integer solution of 512.358 found after 12799 iterations and 256 nodes (6.66 seconds) Full problem 1099 rows 2097 columns, reduced to 76 rows 71 columns After 300 nodes, 39 on tree, 512.358 best solution, best possible 381.276 (7.21 seconds) After 400 nodes, 85 on tree, 512.358 best solution, best possible 451.518 (8.39 seconds) Search completed - best objective 454.8646970349505, took 15744 iterations and 488 nodes (9.44 seconds) Strong branching done 2682 times (24688 iterations), fathomed 11 nodes and fixed 17 variables Maximum depth 28, 556 variables fixed on reduced cost Cuts at root node changed objective from -4407.1 to -3846.22 Probing was tried 249 times and created 61 cuts of which 30 were active after adding rounds of cuts (0.804 seconds) Gomory was tried 330 times and created 685 cuts of which 25 were active after adding rounds of cuts (0.536 seconds) Knapsack was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) Clique was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.044 seconds) FlowCover was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.872 seconds) TwoMirCuts was tried 26 times and created 214 cuts of which 0 were active after adding rounds of cuts (0.072 seconds) implication was tried 320 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 454.8646970349505 after 488 nodes and 15744 iterations - took 9.58 seconds (total time 9.60) Total time 9.66 Solved to optimality. MIP solution: 454.864697 (488 nodes, 9.67 seconds) Best possible: 454.864697 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- neos2.gms(124) 0 Mb --- Reading solution for model m --- neos2.gms(124) 3 Mb *** Status: Normal completion --- Job neos2.gms Stop 08/24/08 04:33:40 elapsed 0:00:09.922