--- Job ran8x32 Start 08/22/08 02:54:27 GAMS Rev 228 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.007 --- 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.016 GAMS/CoinCbc 2.1 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.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 4937.58 - 0.01 seconds processed model has 296 rows, 512 columns (256 integer) and 1024 elements Pass 1: suminf. 0.84269 obj. 5053.29 iterations 70 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 11 rows 14 columns Mini branch and bound improved solution from 5931 to 5837 (0.02 seconds) Round again with cutoff of 5747.06 Pass 2: suminf. 0.84269 obj. 5050.21 iterations 61 Pass 3: suminf. 0.34187 obj. 5747.06 iterations 53 Pass 4: suminf. 0.34187 obj. 5747.06 iterations 4 Pass 5: suminf. 0.40668 obj. 5747.06 iterations 23 Pass 6: suminf. 2.58996 obj. 5747.06 iterations 113 Pass 7: suminf. 2.22885 obj. 5747.06 iterations 46 Pass 8: suminf. 1.57147 obj. 5747.06 iterations 89 Pass 9: suminf. 1.12398 obj. 5747.06 iterations 60 Pass 10: suminf. 1.38376 obj. 5747.06 iterations 57 Pass 11: suminf. 2.93580 obj. 5747.06 iterations 81 Pass 12: suminf. 2.59353 obj. 5747.06 iterations 38 Pass 13: suminf. 1.77477 obj. 5747.06 iterations 51 Pass 14: suminf. 1.69447 obj. 5747.06 iterations 34 Pass 15: suminf. 1.98974 obj. 5747.06 iterations 45 Pass 16: suminf. 1.03570 obj. 5747.06 iterations 28 Pass 17: suminf. 1.72678 obj. 5747.06 iterations 41 Pass 18: suminf. 1.12752 obj. 5747.06 iterations 53 Pass 19: suminf. 1.17409 obj. 5747.06 iterations 39 Pass 20: suminf. 3.33471 obj. 5747.06 iterations 75 Pass 21: suminf. 2.10113 obj. 5747.06 iterations 45 Before mini branch and bound, 199 integers at bound fixed and 196 continuous Full problem 296 rows 512 columns, reduced to 74 rows 105 columns Mini branch and bound improved solution from 5837 to 5562 (0.16 seconds) After 0.16 seconds - Feasibility pump exiting with objective of 5562 - took 0.16 seconds Integer solution of 5562 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Full problem 296 rows 512 columns, reduced to 0 rows 0 columns 42 added rows had average density of 39.1667 At root node, 42 cuts changed objective from 4937.58 to 5150.67 in 13 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.044 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.028 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 51 row cuts (8 active), 0 column cuts in 0.016 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 64 row cuts (22 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 36 row cuts (10 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 44 row cuts (2 active), 0 column cuts in 0.052 seconds - new frequency is -100 After 0 nodes, 1 on tree, 5562 best solution, best possible 5150.67 (0.67 seconds) Integer solution of 5540 found after 7065 iterations and 376 nodes (4.36 seconds) Full problem 296 rows 512 columns, reduced to 35 rows 44 columns Integer solution of 5401 found by combine solutions after 7067 iterations and 377 nodes (4.46 seconds) Full problem 296 rows 512 columns, reduced to 50 rows 66 columns Integer solution of 5336 found by combine solutions after 12205 iterations and 687 nodes (5.49 seconds) After 1000 nodes, 214 on tree, 5336 best solution, best possible 5156.74 (6.20 seconds) After 2000 nodes, 573 on tree, 5336 best solution, best possible 5156.74 (8.87 seconds) After 3000 nodes, 893 on tree, 5336 best solution, best possible 5156.74 (11.44 seconds) After 4000 nodes, 1171 on tree, 5336 best solution, best possible 5156.74 (13.77 seconds) After 5000 nodes, 1458 on tree, 5336 best solution, best possible 5159.23 (15.67 seconds) After 6000 nodes, 1832 on tree, 5336 best solution, best possible 5159.23 (18.07 seconds) Integer solution of 5330 found after 83114 iterations and 6286 nodes (18.69 seconds) Full problem 296 rows 512 columns, reduced to 52 rows 69 columns Integer solution of 5284 found by combine solutions after 83137 iterations and 6287 nodes (18.81 seconds) Integer solution of 5247 found after 87991 iterations and 6641 nodes (19.69 seconds) Full problem 296 rows 512 columns, reduced to 61 rows 82 columns After 7000 nodes, 247 on tree, 5247 best solution, best possible 5214.91 (20.74 seconds) After 8000 nodes, 374 on tree, 5247 best solution, best possible 5229.13 (22.68 seconds) After 9000 nodes, 407 on tree, 5247 best solution, best possible 5236.02 (24.37 seconds) After 10000 nodes, 321 on tree, 5247 best solution, best possible 5241.39 (25.95 seconds) After 11000 nodes, 74 on tree, 5247 best solution, best possible 5246.17 (27.38 seconds) Search completed - best objective 5247, took 126995 iterations and 11177 nodes (27.60 seconds) Strong branching done 4286 times (54446 iterations), fathomed 30 nodes and fixed 849 variables Maximum depth 66, 104238 variables fixed on reduced cost Cuts at root node changed objective from 4937.58 to 5150.67 Probing was tried 763 times and created 301 cuts of which 126 were active after adding rounds of cuts (0.240 seconds) Gomory was tried 13 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) Knapsack was tried 1938 times and created 1764 cuts of which 629 were active after adding rounds of cuts (1.732 seconds) Clique was tried 13 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 1938 times and created 2244 cuts of which 1557 were active after adding rounds of cuts (0.624 seconds) FlowCover was tried 1938 times and created 1963 cuts of which 937 were active after adding rounds of cuts (0.408 seconds) TwoMirCuts was tried 13 times and created 44 cuts of which 2 were active after adding rounds of cuts (0.052 seconds) Result - Finished objective 5247 after 11177 nodes and 126995 iterations - took 27.61 seconds (total time 27.61) Total time 27.62 Solved to optimality. MIP solution: 5247 (11177 nodes, 27.62 seconds) Best possible: 5247 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran8x32.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran8x32.gms Stop 08/22/08 02:54:55 elapsed 0:00:27.924