--- Job ran10x26 Start 08/24/08 05:44:11 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 --- 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.007 --- 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 Cbc: elapsed 0:00:00.016 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 3857.02 - 0.01 seconds Optimal - objective value 3857.02 processed model has 296 rows, 520 columns (260 integer) and 1040 elements Pass 1: suminf. 1.39374 (8) obj. 4154.75 iterations 74 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 (8) obj. 4173.55 iterations 67 Pass 3: suminf. 1.38572 (5) obj. 4641.8 iterations 70 Pass 4: suminf. 1.24590 (4) obj. 4641.8 iterations 10 Pass 5: suminf. 1.33240 (6) obj. 4641.8 iterations 63 Pass 6: suminf. 0.67318 (4) obj. 4641.8 iterations 31 Pass 7: suminf. 1.36876 (5) obj. 4641.8 iterations 54 Pass 8: suminf. 1.19803 (4) obj. 4641.8 iterations 56 Pass 9: suminf. 0.64837 (4) obj. 4641.8 iterations 73 Pass 10: suminf. 0.46546 (3) obj. 4611.64 iterations 12 Pass 11: suminf. 1.15964 (4) obj. 4641.8 iterations 61 Pass 12: suminf. 1.07947 (4) obj. 4641.8 iterations 21 Pass 13: suminf. 1.36876 (5) obj. 4641.8 iterations 49 Pass 14: suminf. 1.19803 (4) obj. 4641.8 iterations 20 Pass 15: suminf. 0.64837 (4) obj. 4641.8 iterations 70 Pass 16: suminf. 0.46546 (3) obj. 4616.74 iterations 16 Pass 17: suminf. 1.07947 (4) obj. 4641.8 iterations 62 Pass 18: suminf. 1.07947 (4) obj. 4641.8 iterations 0 Pass 19: suminf. 1.36876 (5) obj. 4641.8 iterations 56 Pass 20: suminf. 1.19803 (4) obj. 4641.8 iterations 21 Pass 21: suminf. 0.64837 (4) obj. 4641.8 iterations 74 No solution found this major pass Before mini branch and bound, 238 integers at bound fixed and 237 continuous Full problem 296 rows 520 columns, reduced to 29 rows 37 columns Mini branch and bound did not improve solution (0.09 seconds) After 0.09 seconds - Feasibility pump exiting with objective of 4729 - took 0.09 seconds Integer solution of 4729 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) Full problem 296 rows 520 columns, reduced to 0 rows 0 columns 42 added rows had average density of 162 At root node, 42 cuts changed objective from 3857.02 to 4061.12 in 29 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.092 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 1018 row cuts, 0 column cuts (42 active) in 0.132 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 120 row cuts, 0 column cuts (0 active) in 0.008 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) - 142 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 72 row cuts, 0 column cuts (0 active) in 0.184 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 249 row cuts, 0 column cuts (0 active) in 0.056 seconds - new frequency is -100 Optimal - objective value 4061.12 Optimal - objective value 4061.12 After 0 nodes, 1 on tree, 4729 best solution, best possible 4061.12 (1.62 seconds) Integer solution of 4702 found after 12479 iterations and 289 nodes (4.06 seconds) Full problem 296 rows 520 columns, reduced to 35 rows 43 columns Integer solution of 4547 found by combine solutions after 12509 iterations and 290 nodes (4.43 seconds) Integer solution of 4401 found after 28212 iterations and 792 nodes (6.81 seconds) Full problem 296 rows 520 columns, reduced to 56 rows 73 columns Integer solution of 4287 found after 29847 iterations and 870 nodes (7.83 seconds) Full problem 296 rows 520 columns, reduced to 65 rows 86 columns Integer solution of 4281 found by combine solutions after 29908 iterations and 871 nodes (8.80 seconds) After 1000 nodes, 160 on tree, 4281 best solution, best possible 4092.53 (9.25 seconds) Integer solution of 4270 found after 46424 iterations and 1882 nodes (11.61 seconds) Full problem 296 rows 520 columns, reduced to 67 rows 89 columns After 2000 nodes, 348 on tree, 4270 best solution, best possible 4146.93 (12.98 seconds) After 3000 nodes, 569 on tree, 4270 best solution, best possible 4189.37 (16.11 seconds) After 4000 nodes, 729 on tree, 4270 best solution, best possible 4205.06 (18.90 seconds) After 5000 nodes, 829 on tree, 4270 best solution, best possible 4213.99 (21.59 seconds) After 6000 nodes, 874 on tree, 4270 best solution, best possible 4223.07 (24.53 seconds) After 7000 nodes, 892 on tree, 4270 best solution, best possible 4232.4 (27.37 seconds) After 8000 nodes, 893 on tree, 4270 best solution, best possible 4239.88 (30.02 seconds) After 9000 nodes, 864 on tree, 4270 best solution, best possible 4245.99 (32.54 seconds) After 10000 nodes, 827 on tree, 4270 best solution, best possible 4251.05 (34.89 seconds) After 11000 nodes, 736 on tree, 4270 best solution, best possible 4255.87 (37.25 seconds) After 12000 nodes, 630 on tree, 4270 best solution, best possible 4260.09 (39.41 seconds) After 13000 nodes, 469 on tree, 4270 best solution, best possible 4264.23 (41.51 seconds) After 14000 nodes, 158 on tree, 4270 best solution, best possible 4264.23 (43.12 seconds) Search completed - best objective 4270, took 196732 iterations and 14607 nodes (44.32 seconds) Strong branching done 388 times (7402 iterations), fathomed 1 nodes and fixed 0 variables Maximum depth 79, 92741 variables fixed on reduced cost Cuts at root node changed objective from 3857.02 to 4061.12 Probing was tried 3458 times and created 4057 cuts of which 1095 were active after adding rounds of cuts (1.244 seconds) Gomory was tried 2984 times and created 5345 cuts of which 1290 were active after adding rounds of cuts (1.952 seconds) Knapsack was tried 3519 times and created 8907 cuts of which 2044 were active after adding rounds of cuts (1.788 seconds) Clique was tried 29 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3519 times and created 5638 cuts of which 2476 were active after adding rounds of cuts (0.728 seconds) FlowCover was tried 3519 times and created 1595 cuts of which 210 were active after adding rounds of cuts (0.592 seconds) TwoMirCuts was tried 29 times and created 249 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) Result - Finished objective 4270 after 14607 nodes and 196732 iterations - took 44.33 seconds (total time 44.34) Total time 44.35 Solved to optimality. MIP solution: 4270 (14607 nodes, 44.35 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/24/08 05:44:56 elapsed 0:00:45.382