--- Job ran10x10c Start 08/21/08 11:45:16 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 --- 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.012 GAMS/CoinCbc 2.0 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.00.00, build Mar 20 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: obj. 1.51345 --> up = 0 , down = 0 -- rand = 5 ( 21) - 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 15 rows 18 columns Mini branch and bound improved solution from 15334 to 14743 (0.01 seconds) Round again with cutoff of 14389 Pass 2: obj. 2.01345 --> up = 1 , down = 0 Pass 3: obj. 1.51345 --> up = 0 , down = 0 -- rand = 5 ( 24) Pass 4: obj. 1.59381 --> up = 0 , down = 3 Pass 5: obj. 1.30267 --> up = 0 , down = 0 -- rand = 4 ( 13) Pass 6: obj. 2.35168 --> up = 0 , down = 3 Pass 7: obj. 1.42140 --> up = 0 , down = 0 -- rand = 5 ( 18) Pass 8: obj. 2.87237 --> up = 1 , down = 2 Pass 9: obj. 1.03562 --> up = 1 , down = 0 Pass 10: obj. 1.03562 --> up = 0 , down = 0 -- rand = 4 ( 18) Pass 11: obj. 1.47549 --> up = 1 , down = 0 Pass 12: obj. 0.55882 --> up = 0 , down = 0 -- rand = 2 ( 16) Pass 13: obj. 1.29775 --> up = 0 , down = 2 Pass 14: obj. 1.09775 --> up = 0 , down = 0 -- rand = 4 ( 13) Pass 15: obj. 1.29287 --> up = 1 , down = 0 Pass 16: obj. 0.45954 --> up = 0 , down = 0 -- rand = 3 ( 19) Pass 17: obj. 2.06895 --> up = 1 , down = 1 Pass 18: obj. 1.03562 --> up = 0 , down = 0 -- rand = 4 ( 23) perturbation applied Pass 19: obj. 11.99541 --> up = 1 , down = 11 Pass 20: obj. 1.24375 --> up = 0 , down = 0 -- rand = 5 ( 28) Pass 21: obj. 2.00740 --> No solution found this major pass Before mini branch and bound, 71 integers at bound fixed and 70 continuous Full problem 120 rows 200 columns, reduced to 40 rows 54 columns Mini branch and bound improved solution from 14743 to 14149 (0.12 seconds) After 0.12 seconds - Feasibility pump exiting - took 0.12 seconds Integer solution of 14149 found by feasibility pump after 0 iterations and 0 nodes (0.12 seconds) Full problem 120 rows 200 columns, reduced to 0 rows 0 columns 36 added rows had average density of 27.1111 At root node, 36 cuts changed objective from 11203.1 to 12490.6 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.960 seconds - new frequency is 10 Cut generator 1 (Gomory) - 3030 row cuts (5 active), 0 column cuts in 0.144 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 523 row cuts (22 active), 0 column cuts in 0.136 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 254 row cuts (7 active), 0 column cuts in 0.040 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 252 row cuts (2 active), 0 column cuts in 0.052 seconds - new frequency is -100 After 0 nodes, 1 on tree, 14149 best solution, best possible 12490.6 (2.04 seconds) Strong branching is fixing too many variables, too expensively! Full problem 120 rows 200 columns, reduced to 28 rows 34 columns Integer solution of 14027 found by combine solutions after 5238 iterations and 95 nodes (4.22 seconds) Integer solution of 13946 found by rounding after 5344 iterations and 100 nodes (4.29 seconds) Full problem 120 rows 200 columns, reduced to 40 rows 52 columns Integer solution of 13688 found by combine solutions after 5398 iterations and 101 nodes (4.70 seconds) Full problem 120 rows 200 columns, reduced to 44 rows 59 columns Integer solution of 13123 found by combine solutions after 5546 iterations and 109 nodes (5.15 seconds) Full problem 120 rows 200 columns, reduced to 50 rows 69 columns Full problem 120 rows 200 columns, reduced to 54 rows 76 columns Search completed - best objective 13007, took 15188 iterations and 638 nodes (11.32 seconds) Strong branching done 8694 times (97565 iterations), fathomed 143 nodes and fixed 544 variables Maximum depth 23, 5596 variables fixed on reduced cost Cuts at root node changed objective from 11203.1 to 12490.6 Probing was tried 154 times and created 15 cuts of which 5 were active after adding rounds of cuts (0.980 seconds) Gomory was tried 599 times and created 3453 cuts of which 208 were active after adding rounds of cuts (0.280 seconds) Knapsack was tried 637 times and created 2607 cuts of which 384 were active after adding rounds of cuts (0.608 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 100 times and created 254 cuts of which 7 were active after adding rounds of cuts (0.040 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 100 times and created 252 cuts of which 2 were active after adding rounds of cuts (0.052 seconds) Result - Finished objective 13007 after 638 nodes and 15188 iterations - took 11.33 seconds (total time 11.33) Total time 11.33 Solved to optimality. Writing solution. Objective: 13007 Time: 11.33 s --- Restarting execution --- ran10x10c.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10c.gms Stop 08/21/08 11:45:27 elapsed 0:00:11.393