--- Job qiu Start 08/21/08 11:39:59 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.036 --- 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 COINCBC: elapsed 0:00:00.057 GAMS/CoinCbc 2.0 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.00.00, build Mar 20 2008 command line - GAMS/CBC -solve -quit Continuous objective value is -931.639 - 0.05 seconds processed model has 1192 rows, 840 columns (48 integer) and 3432 elements Pass 1: obj. 12.00000 --> up = 0 , down = 0 -- rand = 11 ( 11) Pass 2: obj. 5.42151 --> up = 4 , down = 0 Pass 3: obj. 1.98961 --> up = 0 , down = 0 -- rand = 5 ( 26) - solution found of 933.706 Before mini branch and bound, 5 integers at bound fixed and 110 continuous Full problem 1192 rows 840 columns, reduced to 1034 rows 722 columns - too large Mini branch and bound did not improve solution (0.14 seconds) Round again with cutoff of 747.172 Pass 4: obj. 12.00000 --> up = 0 , down = 0 -- rand = 11 ( 11) Pass 5: obj. 5.60404 --> up = 4 , down = 0 Pass 6: obj. 1.90104 --> up = 1 , down = 0 Pass 7: obj. 1.00359 --> up = 0 , down = 0 -- rand = 3 ( 22) Pass 8: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 20) - solution found of 747.172 Before mini branch and bound, 7 integers at bound fixed and 134 continuous Full problem 1192 rows 840 columns, reduced to 1000 rows 697 columns - too large Mini branch and bound did not improve solution (0.29 seconds) After 0.29 seconds - Feasibility pump exiting - took 0.29 seconds Integer solution of 243.331 found by feasibility pump after 0 iterations and 0 nodes (0.32 seconds) Full problem 1192 rows 840 columns, reduced to 205 rows 155 columns Integer solution of 134.231 found by combine solutions after 630 iterations and 0 nodes (0.72 seconds) 7 added rows had average density of 282.714 At root node, 7 cuts changed objective from -931.639 to -881.506 in 5 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.036 seconds - new frequency is 10 Cut generator 1 (Gomory) - 59 row cuts (1 active), 0 column cuts in 0.020 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.016 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) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 36 row cuts (3 active), 0 column cuts in 0.036 seconds - new frequency is -100 After 0 nodes, 1 on tree, 134.231 best solution, best possible -881.506 (3.34 seconds) Integer solution of 108.452 found by rounding after 20938 iterations and 170 nodes (21.57 seconds) Full problem 1192 rows 840 columns, reduced to 419 rows 297 columns Integer solution of -110.842 found by combine solutions after 20954 iterations and 172 nodes (26.62 seconds) Integer solution of -115.248 found after 55330 iterations and 517 nodes (34.25 seconds) Full problem 1192 rows 840 columns, reduced to 691 rows 479 columns Integer solution of -132.873 found by combine solutions after 55354 iterations and 519 nodes (37.21 seconds) After 1000 nodes, 324 on tree, -132.873 best solution, best possible -573.498 (44.79 seconds) After 2000 nodes, 394 on tree, -132.873 best solution, best possible -573.498 (54.74 seconds) After 3000 nodes, 480 on tree, -132.873 best solution, best possible -527.025 (65.68 seconds) After 4000 nodes, 546 on tree, -132.873 best solution, best possible -527.025 (75.70 seconds) After 5000 nodes, 614 on tree, -132.873 best solution, best possible -527.025 (86.51 seconds) After 6000 nodes, 697 on tree, -132.873 best solution, best possible -503.937 (97.23 seconds) After 7000 nodes, 754 on tree, -132.873 best solution, best possible -444.912 (108.87 seconds) After 8000 nodes, 813 on tree, -132.873 best solution, best possible -444.912 (121.59 seconds) After 9000 nodes, 936 on tree, -132.873 best solution, best possible -408.942 (138.88 seconds) After 10000 nodes, 970 on tree, -132.873 best solution, best possible -408.942 (155.17 seconds) After 11000 nodes, 965 on tree, -132.873 best solution, best possible -408.942 (170.99 seconds) After 12000 nodes, 1254 on tree, -132.873 best solution, best possible -222.99 (192.37 seconds) After 13000 nodes, 1349 on tree, -132.873 best solution, best possible -191.936 (210.87 seconds) After 14000 nodes, 1251 on tree, -132.873 best solution, best possible -191.936 (220.18 seconds) After 15000 nodes, 1179 on tree, -132.873 best solution, best possible -172.996 (237.29 seconds) After 16000 nodes, 995 on tree, -132.873 best solution, best possible -158.766 (253.18 seconds) After 17000 nodes, 713 on tree, -132.873 best solution, best possible -147.524 (268.66 seconds) After 18000 nodes, 337 on tree, -132.873 best solution, best possible -147.524 (280.20 seconds) Search completed - best objective -132.8731369469998, took 1025046 iterations and 18783 nodes (293.52 seconds) Strong branching done 822 times (72238 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 27, 424 variables fixed on reduced cost Cuts at root node changed objective from -931.639 to -881.506 Probing was tried 1037 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.620 seconds) Gomory was tried 1966 times and created 409 cuts of which 76 were active after adding rounds of cuts (3.700 seconds) Knapsack was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) Clique was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 5 times and created 36 cuts of which 3 were active after adding rounds of cuts (0.036 seconds) Result - Finished objective -132.8731369469998 after 18783 nodes and 1025046 iterations - took 293.55 seconds (total time 293.60) Total time 293.63 Solved to optimality. Writing solution. Objective: -132.873 Time: 293.63 s --- Restarting execution --- qiu.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job qiu.gms Stop 08/21/08 11:44:56 elapsed 0:04:56.907