--- Job ran10x10b Start 08/21/08 11:45:13 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 --- ran10x10b.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10b.gdx --- ran10x10b.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.008 --- ran10x10b.gms(123) 4 Mb --- Generating MIP model m --- ran10x10b.gms(124) 4 Mb --- 121 rows 201 columns 601 non-zeroes --- 100 discrete-columns --- Executing COINCBC: elapsed 0:00:00.013 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 2613.47 - -0.00 seconds processed model has 120 rows, 200 columns (100 integer) and 400 elements Pass 1: obj. 1.06873 --> up = 0 , down = 0 -- rand = 3 ( 27) - solution found of 3232 Before mini branch and bound, 95 integers at bound fixed and 95 continuous Full problem 120 rows 200 columns, reduced to 0 rows 0 columns Mini branch and bound improved solution from 3232 to 3232 (0.01 seconds) Round again with cutoff of 3170.15 Pass 2: obj. 1.06873 --> up = 0 , down = 0 -- rand = 3 ( 18) Pass 3: obj. 0.18630 --> up = 0 , down = 0 -- rand = 1 ( 25) Pass 4: obj. 0.35294 --> up = 0 , down = 0 -- rand = 1 ( 11) perturbation applied Pass 5: obj. 14.07479 --> up = 0 , down = 14 Pass 6: obj. 1.74223 --> up = 0 , down = 0 -- rand = 9 ( 23) Pass 7: obj. 3.87674 --> up = 1 , down = 3 Pass 8: obj. 1.46818 --> up = 0 , down = 0 -- rand = 7 ( 11) Pass 9: obj. 3.67309 --> up = 1 , down = 3 Pass 10: obj. 0.75221 --> up = 0 , down = 0 -- rand = 5 ( 22) Pass 11: obj. 3.11016 --> up = 1 , down = 2 Pass 12: obj. 1.22046 --> up = 0 , down = 0 -- rand = 6 ( 22) Pass 13: obj. 2.52062 --> up = 1 , down = 2 Pass 14: obj. 0.63346 --> up = 0 , down = 0 -- rand = 5 ( 24) Pass 15: obj. 3.69054 --> up = 1 , down = 3 Pass 16: obj. 1.16271 --> up = 0 , down = 0 -- rand = 6 ( 22) Pass 17: obj. 3.52069 --> up = 1 , down = 2 Pass 18: obj. 1.12466 --> up = 0 , down = 0 -- rand = 6 ( 27) Pass 19: obj. 3.51136 --> up = 1 , down = 3 Pass 20: obj. 1.12643 --> up = 0 , down = 0 -- rand = 6 ( 27) Pass 21: obj. 4.23804 --> No solution found this major pass Before mini branch and bound, 73 integers at bound fixed and 70 continuous Full problem 120 rows 200 columns, reduced to 37 rows 51 columns Mini branch and bound did not improve solution (0.04 seconds) After 0.04 seconds - Feasibility pump exiting - took 0.04 seconds Integer solution of 3232 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Full problem 120 rows 200 columns, reduced to 0 rows 0 columns 21 added rows had average density of 48.2381 At root node, 21 cuts changed objective from 2613.47 to 2995.07 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.812 seconds - new frequency is 10 Cut generator 1 (Gomory) - 2314 row cuts (4 active), 0 column cuts in 0.104 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 297 row cuts (10 active), 0 column cuts in 0.088 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 303 row cuts (6 active), 0 column cuts in 0.020 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) - 196 row cuts (1 active), 0 column cuts in 0.028 seconds - new frequency is -100 After 0 nodes, 1 on tree, 3232 best solution, best possible 2995.07 (1.52 seconds) Integer solution of 3187 found after 2540 iterations and 10 nodes (1.78 seconds) Full problem 120 rows 200 columns, reduced to 11 rows 13 columns Integer solution of 3141 found by combine solutions after 2552 iterations and 11 nodes (1.81 seconds) Strong branching is fixing too many variables, too expensively! Full problem 120 rows 200 columns, reduced to 18 rows 22 columns Search completed - best objective 3073, took 3384 iterations and 50 nodes (2.37 seconds) Strong branching done 1462 times (16034 iterations), fathomed 16 nodes and fixed 56 variables Maximum depth 6, 650 variables fixed on reduced cost Cuts at root node changed objective from 2613.47 to 2995.07 Probing was tried 104 times and created 4 cuts of which 3 were active after adding rounds of cuts (0.812 seconds) Gomory was tried 142 times and created 2336 cuts of which 16 were active after adding rounds of cuts (0.136 seconds) Knapsack was tried 100 times and created 297 cuts of which 10 were active after adding rounds of cuts (0.088 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 100 times and created 303 cuts of which 6 were active after adding rounds of cuts (0.020 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 196 cuts of which 1 were active after adding rounds of cuts (0.028 seconds) Result - Finished objective 3073 after 50 nodes and 3384 iterations - took 2.38 seconds (total time 2.38) Total time 2.38 Solved to optimality. Writing solution. Objective: 3073 Time: 2.38 s --- Restarting execution --- ran10x10b.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10b.gms Stop 08/21/08 11:45:16 elapsed 0:00:02.429