--- Job qiu Start 08/24/08 05:32:10 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 --- qiu.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/qiu.gdx --- qiu.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.012 --- qiu.gms(123) 4 Mb --- Generating MIP model m --- qiu.gms(124) 4 Mb --- 1,193 rows 841 columns 3,745 non-zeroes --- 48 discrete-columns --- qiu.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.033 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 840 columns and 1192 rows. 48 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 -931.639 - 0.09 seconds Optimal - objective value -931.639 processed model has 1192 rows, 840 columns (48 integer) and 3432 elements Pass 1: suminf. 12.00000 (36) obj. -931.639 iterations 0 Pass 2: suminf. 1.37706 (3) obj. 1042.35 iterations 444 Solution found of 1199.38 Before mini branch and bound, 1 integers at bound fixed and 29 continuous Full problem 1192 rows 840 columns, reduced to 1135 rows 799 columns - too large Mini branch and bound did not improve solution (0.12 seconds) Round again with cutoff of 986.28 Pass 3: suminf. 12.00000 (36) obj. -931.639 iterations 0 Pass 4: suminf. 1.28410 (4) obj. 772.761 iterations 526 Solution found of 919.192 Before mini branch and bound, 1 integers at bound fixed and 24 continuous Full problem 1192 rows 840 columns, reduced to 1145 rows 806 columns - too large Mini branch and bound did not improve solution (0.27 seconds) After 0.27 seconds - Feasibility pump exiting with objective of 919.192 - took 0.26 seconds Integer solution of 778.871 found by feasibility pump after 0 iterations and 0 nodes (0.30 seconds) Full problem 1192 rows 840 columns, reduced to 576 rows 362 columns Integer solution of -115.248 found by combine solutions after 0 iterations and 0 nodes (1.12 seconds) 24 added rows had average density of 743.208 At root node, 24 cuts changed objective from -931.639 to -843.561 in 24 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.176 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 1140 row cuts, 0 column cuts (24 active) in 0.280 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.044 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.032 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.228 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 72 row cuts, 0 column cuts (0 active) in 0.068 seconds - new frequency is -100 Optimal - objective value -843.561 Optimal - objective value -843.561 After 0 nodes, 1 on tree, -115.248 best solution, best possible -843.561 (11.69 seconds) Integer solution of -119.654 found after 29456 iterations and 211 nodes (21.24 seconds) Full problem 1192 rows 840 columns, reduced to 695 rows 471 columns - too large After 1000 nodes, 472 on tree, -119.654 best solution, best possible -668.012 (46.73 seconds) Integer solution of -128.467 found after 148476 iterations and 1249 nodes (52.97 seconds) Full problem 1192 rows 840 columns, reduced to 746 rows 515 columns - too large After 2000 nodes, 943 on tree, -128.467 best solution, best possible -623.53 (72.96 seconds) After 3000 nodes, 1359 on tree, -128.467 best solution, best possible -623.53 (95.83 seconds) Integer solution of -132.873 found after 359553 iterations and 3381 nodes (104.37 seconds) Full problem 1192 rows 840 columns, reduced to 746 rows 515 columns - too large After 4000 nodes, 1745 on tree, -132.873 best solution, best possible -551.7 (116.74 seconds) After 5000 nodes, 2063 on tree, -132.873 best solution, best possible -551.7 (135.99 seconds) After 6000 nodes, 2310 on tree, -132.873 best solution, best possible -551.7 (152.28 seconds) After 7000 nodes, 2481 on tree, -132.873 best solution, best possible -551.7 (168.31 seconds) After 8000 nodes, 2568 on tree, -132.873 best solution, best possible -551.7 (181.50 seconds) After 9000 nodes, 2672 on tree, -132.873 best solution, best possible -551.7 (195.88 seconds) After 10000 nodes, 2774 on tree, -132.873 best solution, best possible -463.368 (210.69 seconds) After 11000 nodes, 2830 on tree, -132.873 best solution, best possible -463.368 (224.03 seconds) After 12000 nodes, 3232 on tree, -132.873 best solution, best possible -330.153 (249.31 seconds) After 13000 nodes, 3552 on tree, -132.873 best solution, best possible -299.153 (272.86 seconds) After 14000 nodes, 3651 on tree, -132.873 best solution, best possible -299.153 (287.12 seconds) After 15000 nodes, 3905 on tree, -132.873 best solution, best possible -275.01 (309.60 seconds) After 16000 nodes, 4120 on tree, -132.873 best solution, best possible -255.902 (330.86 seconds) After 17000 nodes, 4296 on tree, -132.873 best solution, best possible -242.089 (351.20 seconds) After 18000 nodes, 4266 on tree, -132.873 best solution, best possible -242.089 (361.06 seconds) After 19000 nodes, 4419 on tree, -132.873 best solution, best possible -229.065 (380.73 seconds) After 20000 nodes, 4547 on tree, -132.873 best solution, best possible -218.145 (399.94 seconds) After 21000 nodes, 4636 on tree, -132.873 best solution, best possible -209.294 (418.69 seconds) After 22000 nodes, 4554 on tree, -132.873 best solution, best possible -209.294 (427.23 seconds) After 23000 nodes, 4599 on tree, -132.873 best solution, best possible -200.405 (445.75 seconds) After 24000 nodes, 4578 on tree, -132.873 best solution, best possible -192.231 (463.88 seconds) After 25000 nodes, 4468 on tree, -132.873 best solution, best possible -184.608 (481.45 seconds) After 26000 nodes, 4345 on tree, -132.873 best solution, best possible -184.608 (490.46 seconds) After 27000 nodes, 4120 on tree, -132.873 best solution, best possible -177.765 (508.38 seconds) After 28000 nodes, 3862 on tree, -132.873 best solution, best possible -171.579 (525.53 seconds) After 29000 nodes, 3541 on tree, -132.873 best solution, best possible -166.074 (542.98 seconds) After 30000 nodes, 3320 on tree, -132.873 best solution, best possible -166.074 (553.18 seconds) After 31000 nodes, 2944 on tree, -132.873 best solution, best possible -160.511 (570.36 seconds) After 32000 nodes, 2561 on tree, -132.873 best solution, best possible -155.457 (587.50 seconds) After 33000 nodes, 2142 on tree, -132.873 best solution, best possible -150.716 (604.31 seconds) After 34000 nodes, 1712 on tree, -132.873 best solution, best possible -150.716 (618.10 seconds) After 35000 nodes, 1266 on tree, -132.873 best solution, best possible -145.434 (635.44 seconds) After 36000 nodes, 798 on tree, -132.873 best solution, best possible -140.075 (652.74 seconds) After 37000 nodes, 322 on tree, -132.873 best solution, best possible -135.565 (669.65 seconds) Search completed - best objective -132.8731369469998, took 2221457 iterations and 37652 nodes (680.58 seconds) Strong branching done 96 times (9600 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 32, 2087 variables fixed on reduced cost Cuts at root node changed objective from -931.639 to -843.561 Probing was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.184 seconds) Gomory was tried 3770 times and created 1738 cuts of which 92 were active after adding rounds of cuts (8.565 seconds) Knapsack was tried 24 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.044 seconds) Clique was tried 24 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 24 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) FlowCover was tried 24 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.228 seconds) TwoMirCuts was tried 24 times and created 72 cuts of which 0 were active after adding rounds of cuts (0.068 seconds) Result - Finished objective -132.8731369469998 after 37652 nodes and 2221457 iterations - took 680.62 seconds (total time 680.71) Total time 680.76 Solved to optimality. MIP solution: -132.8731369 (37652 nodes, 680.76 seconds) Best possible: -132.8731369 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- qiu.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job qiu.gms Stop 08/24/08 05:43:41 elapsed 0:11:30.774