--- Job ran8x32 Start 08/21/08 12:42:28 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 --- ran8x32.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran8x32.gdx --- ran8x32.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.008 --- ran8x32.gms(123) 4 Mb --- Generating MIP model m --- ran8x32.gms(124) 4 Mb --- 297 rows 513 columns 1,537 non-zeroes --- 256 discrete-columns --- Executing COINCBC: elapsed 0:00:00.017 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 512 columns and 296 rows. 256 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 4937.58 - 0.00 seconds processed model has 296 rows, 512 columns (256 integer) and 1024 elements Pass 1: obj. 0.84269 --> up = 0 , down = 0 -- rand = 7 ( 14) - solution found of 5931 Before mini branch and bound, 242 integers at bound fixed and 241 continuous Full problem 296 rows 512 columns, reduced to 8 rows 10 columns Mini branch and bound improved solution from 5931 to 5837 (0.02 seconds) Round again with cutoff of 5747.06 Pass 2: obj. 0.84269 --> up = 0 , down = 0 -- rand = 7 ( 19) Pass 3: obj. 0.97824 --> up = 0 , down = 1 Pass 4: obj. 0.34187 --> up = 0 , down = 0 -- rand = 2 ( 22) Pass 5: obj. 1.59332 --> up = 1 , down = 1 perturbation applied Pass 6: obj. 44.45034 --> up = 1 , down = 44 Pass 7: obj. 0.94356 --> up = 0 , down = 0 -- rand = 7 ( 17) Pass 8: obj. 3.59650 --> up = 1 , down = 2 Pass 9: obj. 1.21491 --> up = 0 , down = 0 -- rand = 5 ( 15) Pass 10: obj. 2.44853 --> up = 2 , down = 0 Pass 11: obj. 0.72631 --> up = 0 , down = 0 -- rand = 7 ( 16) Pass 12: obj. 4.67830 --> up = 0 , down = 3 Pass 13: obj. 1.78081 --> up = 1 , down = 0 Pass 14: obj. 1.38981 --> up = 0 , down = 0 -- rand = 6 ( 13) Pass 15: obj. 2.30256 --> up = 1 , down = 1 Pass 16: obj. 0.64551 --> up = 0 , down = 0 -- rand = 5 ( 24) Pass 17: obj. 4.34946 --> up = 1 , down = 4 perturbation applied Pass 18: obj. 49.55727 --> up = 2 , down = 47 Pass 19: obj. 2.14263 --> up = 0 , down = 1 Pass 20: obj. 1.23216 --> up = 0 , down = 0 -- rand = 8 ( 17) Pass 21: obj. 4.91329 --> No solution found this major pass Before mini branch and bound, 211 integers at bound fixed and 209 continuous Full problem 296 rows 512 columns, reduced to 56 rows 80 columns Mini branch and bound improved solution from 5837 to 5609 (0.14 seconds) After 0.15 seconds - Feasibility pump exiting - took 0.14 seconds Integer solution of 5609 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) Full problem 296 rows 512 columns, reduced to 0 rows 0 columns 34 added rows had average density of 129.353 At root node, 34 cuts changed objective from 4937.58 to 5151.6 in 28 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.640 seconds - new frequency is 10 Cut generator 1 (Gomory) - 958 row cuts (7 active), 0 column cuts in 0.116 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 80 row cuts (8 active), 0 column cuts in 0.024 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) - 157 row cuts (18 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 29 row cuts (1 active), 0 column cuts in 0.052 seconds - new frequency is -100 After 0 nodes, 1 on tree, 5609 best solution, best possible 5151.6 (1.82 seconds) Integer solution of 5602 found by rounding after 7555 iterations and 290 nodes (6.87 seconds) Full problem 296 rows 512 columns, reduced to 36 rows 46 columns Integer solution of 5497 found by combine solutions after 7574 iterations and 291 nodes (7.33 seconds) After 1000 nodes, 75 on tree, 5497 best solution, best possible 5163.26 (8.68 seconds) Integer solution of 5492 found after 14779 iterations and 1778 nodes (10.04 seconds) Full problem 296 rows 512 columns, reduced to 41 rows 53 columns Integer solution of 5374 found by combine solutions after 14780 iterations and 1779 nodes (10.51 seconds) After 2000 nodes, 138 on tree, 5374 best solution, best possible 5163.26 (11.30 seconds) After 3000 nodes, 552 on tree, 5374 best solution, best possible 5163.26 (13.79 seconds) After 4000 nodes, 916 on tree, 5374 best solution, best possible 5163.26 (15.73 seconds) After 5000 nodes, 1228 on tree, 5374 best solution, best possible 5163.26 (17.78 seconds) Integer solution of 5369 found by rounding after 54544 iterations and 5195 nodes (18.18 seconds) Full problem 296 rows 512 columns, reduced to 55 rows 73 columns Integer solution of 5247 found by combine solutions after 54565 iterations and 5196 nodes (19.01 seconds) After 6000 nodes, 207 on tree, 5247 best solution, best possible 5163.26 (20.91 seconds) After 7000 nodes, 320 on tree, 5247 best solution, best possible 5163.26 (22.75 seconds) After 8000 nodes, 377 on tree, 5247 best solution, best possible 5163.26 (24.74 seconds) After 9000 nodes, 389 on tree, 5247 best solution, best possible 5163.26 (26.65 seconds) After 10000 nodes, 341 on tree, 5247 best solution, best possible 5163.3 (28.41 seconds) After 11000 nodes, 429 on tree, 5247 best solution, best possible 5163.3 (30.72 seconds) After 12000 nodes, 564 on tree, 5247 best solution, best possible 5226.48 (34.33 seconds) After 13000 nodes, 631 on tree, 5247 best solution, best possible 5233.92 (37.11 seconds) After 14000 nodes, 504 on tree, 5247 best solution, best possible 5233.92 (38.63 seconds) After 15000 nodes, 485 on tree, 5247 best solution, best possible 5240.01 (40.55 seconds) After 16000 nodes, 328 on tree, 5247 best solution, best possible 5244.18 (42.21 seconds) After 17000 nodes, 24 on tree, 5247 best solution, best possible 5246.88 (43.66 seconds) Search completed - best objective 5247, took 121388 iterations and 17050 nodes (43.72 seconds) Strong branching done 7282 times (83964 iterations), fathomed 298 nodes and fixed 1196 variables Maximum depth 66, 95101 variables fixed on reduced cost Cuts at root node changed objective from 4937.58 to 5151.6 Probing was tried 1035 times and created 432 cuts of which 237 were active after adding rounds of cuts (1.064 seconds) Gomory was tried 2114 times and created 1033 cuts of which 51 were active after adding rounds of cuts (1.252 seconds) Knapsack was tried 28 times and created 80 cuts of which 8 were active after adding rounds of cuts (0.024 seconds) Clique was tried 28 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 2367 times and created 2329 cuts of which 1704 were active after adding rounds of cuts (0.528 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 28 times and created 29 cuts of which 1 were active after adding rounds of cuts (0.052 seconds) Result - Finished objective 5247 after 17050 nodes and 121388 iterations - took 43.73 seconds (total time 43.74) Total time 43.74 Solved to optimality. Writing solution. Objective: 5247 Time: 43.75 s --- Restarting execution --- ran8x32.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran8x32.gms Stop 08/21/08 12:43:12 elapsed 0:00:43.873