--- Job ran8x32 Start 08/24/08 06:44:08 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.019 --- 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 Cbc: elapsed 0:00:00.039 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 4937.58 - 0.01 seconds Optimal - objective value 4937.58 processed model has 296 rows, 512 columns (256 integer) and 1024 elements Pass 1: suminf. 0.84269 (7) obj. 5050.21 iterations 61 Solution found of 5963 Before mini branch and bound, 242 integers at bound fixed and 241 continuous Full problem 296 rows 512 columns, reduced to 9 rows 12 columns Mini branch and bound improved solution from 5963 to 5837 (0.02 seconds) Round again with cutoff of 5747.06 Pass 2: suminf. 0.84269 (7) obj. 5050.21 iterations 46 Pass 3: suminf. 0.34187 (2) obj. 5747.06 iterations 62 Pass 4: suminf. 0.34187 (2) obj. 5747.06 iterations 4 Pass 5: suminf. 0.40668 (2) obj. 5747.06 iterations 23 Pass 6: suminf. 2.58996 (10) obj. 5747.06 iterations 88 Pass 7: suminf. 2.22885 (10) obj. 5747.06 iterations 48 Pass 8: suminf. 1.57147 (5) obj. 5747.06 iterations 86 Pass 9: suminf. 1.12398 (5) obj. 5747.06 iterations 45 Pass 10: suminf. 1.38376 (5) obj. 5747.06 iterations 47 Pass 11: suminf. 2.93580 (9) obj. 5747.06 iterations 93 Pass 12: suminf. 1.83034 (8) obj. 5747.06 iterations 54 Pass 13: suminf. 2.49124 (10) obj. 5747.06 iterations 63 Pass 14: suminf. 1.47821 (9) obj. 5747.06 iterations 36 Pass 15: suminf. 1.39450 (7) obj. 5747.06 iterations 51 Pass 16: suminf. 1.30731 (6) obj. 5747.06 iterations 23 Pass 17: suminf. 1.46946 (9) obj. 5747.06 iterations 61 Pass 18: suminf. 1.03203 (7) obj. 5747.06 iterations 50 Pass 19: suminf. 1.61628 (6) obj. 5747.06 iterations 50 Pass 20: suminf. 1.39547 (8) obj. 5747.06 iterations 32 Pass 21: suminf. 3.93079 (13) obj. 5747.06 iterations 90 No solution found this major pass Before mini branch and bound, 199 integers at bound fixed and 197 continuous Full problem 296 rows 512 columns, reduced to 75 rows 105 columns Mini branch and bound did not improve solution (0.14 seconds) After 0.14 seconds - Feasibility pump exiting with objective of 5837 - took 0.14 seconds Integer solution of 5837 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) Full problem 296 rows 512 columns, reduced to 0 rows 0 columns 37 added rows had average density of 124.703 At root node, 37 cuts changed objective from 4937.58 to 5147.95 in 19 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.056 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 602 row cuts, 0 column cuts (37 active) in 0.072 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 63 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 110 row cuts, 0 column cuts (0 active) in -0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 52 row cuts, 0 column cuts (0 active) in 0.080 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 257 row cuts, 0 column cuts (0 active) in 0.052 seconds - new frequency is -100 Optimal - objective value 5147.95 Optimal - objective value 5147.95 After 0 nodes, 1 on tree, 5837 best solution, best possible 5147.95 (1.12 seconds) Full problem 296 rows 512 columns, reduced to 45 rows 58 columns Integer solution of 5552 found by combine solutions after 8632 iterations and 266 nodes (6.38 seconds) Full problem 296 rows 512 columns, reduced to 60 rows 81 columns After 1000 nodes, 285 on tree, 5332 best solution, best possible 5162.75 (9.83 seconds) After 2000 nodes, 586 on tree, 5332 best solution, best possible 5162.75 (12.62 seconds) Integer solution of 5302 found after 36356 iterations and 2135 nodes (12.94 seconds) Full problem 296 rows 512 columns, reduced to 68 rows 93 columns After 3000 nodes, 667 on tree, 5302 best solution, best possible 5193.2 (16.24 seconds) Integer solution of 5301 found after 58682 iterations and 3493 nodes (17.68 seconds) Full problem 296 rows 512 columns, reduced to 68 rows 93 columns After 4000 nodes, 819 on tree, 5301 best solution, best possible 5200.29 (19.88 seconds) Integer solution of 5277 found after 72538 iterations and 4500 nodes (21.18 seconds) Full problem 296 rows 512 columns, reduced to 71 rows 98 columns Integer solution of 5247 found after 76721 iterations and 4771 nodes (22.75 seconds) Full problem 296 rows 512 columns, reduced to 77 rows 107 columns After 5000 nodes, 118 on tree, 5247 best solution, best possible 5232.12 (24.39 seconds) Search completed - best objective 5247, took 86202 iterations and 5784 nodes (26.05 seconds) Strong branching done 3042 times (42831 iterations), fathomed 17 nodes and fixed 218 variables Maximum depth 65, 60302 variables fixed on reduced cost Cuts at root node changed objective from 4937.58 to 5147.95 Probing was tried 1226 times and created 694 cuts of which 235 were active after adding rounds of cuts (0.536 seconds) Gomory was tried 1836 times and created 1935 cuts of which 556 were active after adding rounds of cuts (1.220 seconds) Knapsack was tried 2023 times and created 2369 cuts of which 877 were active after adding rounds of cuts (0.892 seconds) Clique was tried 19 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 2023 times and created 3217 cuts of which 1685 were active after adding rounds of cuts (0.536 seconds) FlowCover was tried 2023 times and created 1679 cuts of which 403 were active after adding rounds of cuts (0.548 seconds) TwoMirCuts was tried 19 times and created 257 cuts of which 0 were active after adding rounds of cuts (0.052 seconds) Result - Finished objective 5247 after 5784 nodes and 86202 iterations - took 26.05 seconds (total time 26.06) Total time 26.07 Solved to optimality. MIP solution: 5247 (5784 nodes, 26.08 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/24/08 06:44:35 elapsed 0:00:26.507