--- Job ran10x26 Start 08/22/08 01:47:12 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 --- ran10x26.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x26.gdx --- ran10x26.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- ran10x26.gms(123) 4 Mb --- Generating MIP model m --- ran10x26.gms(124) 4 Mb --- 297 rows 521 columns 1,561 non-zeroes --- 260 discrete-columns --- Executing COINCBC: elapsed 0:00:00.015 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 520 columns and 296 rows. 260 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 3857.02 - 0.01 seconds processed model has 296 rows, 520 columns (260 integer) and 1040 elements Pass 1: suminf. 1.39374 obj. 4154.75 iterations 76 Solution found of 5117 Before mini branch and bound, 243 integers at bound fixed and 243 continuous Full problem 296 rows 520 columns, reduced to 18 rows 21 columns Mini branch and bound improved solution from 5117 to 4729 (0.02 seconds) Round again with cutoff of 4641.8 Pass 2: suminf. 1.39374 obj. 4173.55 iterations 73 Pass 3: suminf. 1.38572 obj. 4641.8 iterations 74 Pass 4: suminf. 1.24590 obj. 4641.8 iterations 10 Pass 5: suminf. 1.33240 obj. 4641.8 iterations 74 Pass 6: suminf. 0.67318 obj. 4641.8 iterations 37 Pass 7: suminf. 1.36876 obj. 4641.8 iterations 70 Pass 8: suminf. 1.19803 obj. 4641.8 iterations 66 Pass 9: suminf. 0.64837 obj. 4641.8 iterations 82 Pass 10: suminf. 0.46546 obj. 4611.64 iterations 20 Pass 11: suminf. 1.15964 obj. 4641.8 iterations 65 Pass 12: suminf. 1.07947 obj. 4641.8 iterations 25 Pass 13: suminf. 1.36876 obj. 4641.8 iterations 53 Pass 14: suminf. 1.19803 obj. 4641.8 iterations 30 Pass 15: suminf. 0.64837 obj. 4641.8 iterations 93 Pass 16: suminf. 0.46546 obj. 4611.64 iterations 23 Pass 17: suminf. 1.15964 obj. 4641.8 iterations 72 Pass 18: suminf. 1.07947 obj. 4641.8 iterations 29 Pass 19: suminf. 1.36876 obj. 4641.8 iterations 52 Pass 20: suminf. 1.19803 obj. 4641.8 iterations 24 Pass 21: suminf. 0.64837 obj. 4641.8 iterations 79 Before mini branch and bound, 239 integers at bound fixed and 238 continuous Full problem 296 rows 520 columns, reduced to 28 rows 35 columns Mini branch and bound did not improve solution (0.08 seconds) After 0.08 seconds - Feasibility pump exiting with objective of 8 - took 0.08 seconds Integer solution of 5117 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Full problem 296 rows 520 columns, reduced to 0 rows 0 columns 35 added rows had average density of 36.0857 At root node, 35 cuts changed objective from 3857.02 to 4051.51 in 17 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.068 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.052 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 64 row cuts (9 active), 0 column cuts in 0.012 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) - 60 row cuts (16 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 49 row cuts (8 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 30 row cuts (2 active), 0 column cuts in 0.044 seconds - new frequency is -100 After 0 nodes, 1 on tree, 5117 best solution, best possible 4051.51 (0.61 seconds) Integer solution of 4976 found after 7904 iterations and 178 nodes (4.89 seconds) Full problem 296 rows 520 columns, reduced to 44 rows 56 columns Integer solution of 4551 found by combine solutions after 7934 iterations and 179 nodes (4.96 seconds) Integer solution of 4325 found after 17446 iterations and 501 nodes (6.82 seconds) Full problem 296 rows 520 columns, reduced to 50 rows 65 columns After 1000 nodes, 326 on tree, 4325 best solution, best possible 4115.95 (8.83 seconds) Integer solution of 4287 found after 29890 iterations and 1029 nodes (8.93 seconds) Full problem 296 rows 520 columns, reduced to 61 rows 81 columns Integer solution of 4281 found by combine solutions after 29894 iterations and 1030 nodes (8.97 seconds) After 2000 nodes, 401 on tree, 4281 best solution, best possible 4115.95 (11.74 seconds) Full problem 296 rows 520 columns, reduced to 65 rows 87 columns After 3000 nodes, 527 on tree, 4270 best solution, best possible 4187.44 (14.66 seconds) After 4000 nodes, 723 on tree, 4270 best solution, best possible 4206.81 (17.12 seconds) After 5000 nodes, 866 on tree, 4270 best solution, best possible 4217.2 (19.41 seconds) After 6000 nodes, 959 on tree, 4270 best solution, best possible 4225.37 (21.46 seconds) After 7000 nodes, 1026 on tree, 4270 best solution, best possible 4231.65 (23.45 seconds) After 8000 nodes, 1050 on tree, 4270 best solution, best possible 4237.2 (25.45 seconds) After 9000 nodes, 1078 on tree, 4270 best solution, best possible 4242.37 (27.29 seconds) After 10000 nodes, 1072 on tree, 4270 best solution, best possible 4247.02 (29.09 seconds) After 11000 nodes, 1067 on tree, 4270 best solution, best possible 4250.6 (30.76 seconds) After 12000 nodes, 1000 on tree, 4270 best solution, best possible 4253.97 (32.42 seconds) After 13000 nodes, 914 on tree, 4270 best solution, best possible 4257.39 (34.07 seconds) After 14000 nodes, 691 on tree, 4270 best solution, best possible 4257.39 (35.36 seconds) After 15000 nodes, 562 on tree, 4270 best solution, best possible 4262.3 (37.05 seconds) After 16000 nodes, 380 on tree, 4270 best solution, best possible 4266.06 (38.62 seconds) After 17000 nodes, 74 on tree, 4270 best solution, best possible 4269.55 (40.07 seconds) Search completed - best objective 4270, took 189768 iterations and 17161 nodes (40.27 seconds) Strong branching done 4532 times (75647 iterations), fathomed 73 nodes and fixed 798 variables Maximum depth 76, 96012 variables fixed on reduced cost Cuts at root node changed objective from 3857.02 to 4051.51 Probing was tried 1248 times and created 841 cuts of which 394 were active after adding rounds of cuts (0.432 seconds) Gomory was tried 17 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.052 seconds) Knapsack was tried 2211 times and created 3793 cuts of which 1161 were active after adding rounds of cuts (2.120 seconds) Clique was tried 17 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 2211 times and created 3941 cuts of which 2472 were active after adding rounds of cuts (0.496 seconds) FlowCover was tried 2211 times and created 1956 cuts of which 997 were active after adding rounds of cuts (0.316 seconds) TwoMirCuts was tried 17 times and created 30 cuts of which 2 were active after adding rounds of cuts (0.044 seconds) Result - Finished objective 4270 after 17161 nodes and 189768 iterations - took 40.27 seconds (total time 40.28) Total time 40.29 Solved to optimality. MIP solution: 4270 (17161 nodes, 40.29 seconds) Best possible: 4270 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran10x26.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x26.gms Stop 08/22/08 01:47:54 elapsed 0:00:41.112