--- Job ran10x10c Start 08/22/08 01:47:06 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 --- ran10x10c.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10c.gdx --- ran10x10c.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- ran10x10c.gms(123) 4 Mb --- Generating MIP model m --- ran10x10c.gms(124) 4 Mb --- 121 rows 201 columns 601 non-zeroes --- 100 discrete-columns --- Executing COINCBC: elapsed 0:00:00.010 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 200 columns and 120 rows. 100 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 11203.1 - 0.00 seconds processed model has 120 rows, 200 columns (100 integer) and 400 elements Pass 1: suminf. 1.51345 obj. 11714 iterations 39 Pass 2: suminf. 1.51345 obj. 11714 iterations 1 Solution found of 15334 Before mini branch and bound, 84 integers at bound fixed and 84 continuous Full problem 120 rows 200 columns, reduced to 19 rows 22 columns Mini branch and bound improved solution from 15334 to 14743 (0.01 seconds) Round again with cutoff of 14389 Pass 3: suminf. 1.51345 obj. 11655.2 iterations 30 Pass 4: suminf. 0.48208 obj. 14389 iterations 24 Pass 5: suminf. 0.41176 obj. 14318.4 iterations 11 Pass 6: suminf. 2.17474 obj. 14389 iterations 79 Pass 7: suminf. 1.44029 obj. 14300.1 iterations 13 Pass 8: suminf. 1.17440 obj. 14389 iterations 22 Pass 9: suminf. 1.35913 obj. 14389 iterations 32 Pass 10: suminf. 2.39932 obj. 14389 iterations 43 Pass 11: suminf. 1.63053 obj. 14389 iterations 20 Pass 12: suminf. 2.26946 obj. 14389 iterations 31 Pass 13: suminf. 1.85266 obj. 14389 iterations 11 Pass 14: suminf. 1.45702 obj. 14389 iterations 38 Pass 15: suminf. 1.32257 obj. 14389 iterations 15 Pass 16: suminf. 1.68018 obj. 14389 iterations 31 Pass 17: suminf. 1.37300 obj. 14389 iterations 12 Pass 18: suminf. 1.37300 obj. 14389 iterations 5 Pass 19: suminf. 1.45702 obj. 14389 iterations 27 Pass 20: suminf. 1.32257 obj. 14389 iterations 15 Pass 21: suminf. 1.68018 obj. 14389 iterations 29 Pass 22: suminf. 1.37300 obj. 14389 iterations 14 Before mini branch and bound, 56 integers at bound fixed and 56 continuous Full problem 120 rows 200 columns, reduced to 59 rows 83 columns Mini branch and bound improved solution from 14743 to 14204 (0.10 seconds) After 0.10 seconds - Feasibility pump exiting with objective of 14204 - took 0.10 seconds Integer solution of 14204 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) Full problem 120 rows 200 columns, reduced to 0 rows 0 columns 35 added rows had average density of 37.0286 At root node, 35 cuts changed objective from 11203.1 to 12432.3 in 26 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.284 seconds - new frequency is 10 Cut generator 1 (Gomory) - 74 row cuts (4 active), 0 column cuts in 0.016 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 145 row cuts (17 active), 0 column cuts in 0.044 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) - 71 row cuts (8 active), 0 column cuts in -0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 46 row cuts (4 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 281 row cuts (2 active), 0 column cuts in 0.040 seconds - new frequency is -100 After 0 nodes, 1 on tree, 14204 best solution, best possible 12432.3 (0.70 seconds) Full problem 120 rows 200 columns, reduced to 31 rows 38 columns Strong branching is fixing too many variables, too expensively! Search completed - best objective 13007, took 5951 iterations and 206 nodes (3.56 seconds) Strong branching done 4036 times (37597 iterations), fathomed 66 nodes and fixed 280 variables Maximum depth 25, 2360 variables fixed on reduced cost Cuts at root node changed objective from 11203.1 to 12432.3 Probing was tried 46 times and created 9 cuts of which 1 were active after adding rounds of cuts (0.292 seconds) Gomory was tried 213 times and created 363 cuts of which 82 were active after adding rounds of cuts (0.072 seconds) Knapsack was tried 227 times and created 610 cuts of which 88 were active after adding rounds of cuts (0.196 seconds) Clique was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 227 times and created 521 cuts of which 256 were active after adding rounds of cuts (0.016 seconds) FlowCover was tried 26 times and created 46 cuts of which 4 were active after adding rounds of cuts (0.020 seconds) TwoMirCuts was tried 26 times and created 281 cuts of which 2 were active after adding rounds of cuts (0.040 seconds) Result - Finished objective 13007 after 206 nodes and 5951 iterations - took 3.57 seconds (total time 3.57) Total time 3.58 Solved to optimality. MIP solution: 13007 (206 nodes, 3.57 seconds) Best possible: 13007 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran10x10c.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10c.gms Stop 08/22/08 01:47:09 elapsed 0:00:03.636