--- Job l152lav Start 08/21/08 08:03:25 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 --- l152lav.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/l152lav.gdx --- l152lav.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.031 --- l152lav.gms(123) 4 Mb --- Generating MIP model m --- l152lav.gms(124) 4 Mb --- 98 rows 1,990 columns 11,912 non-zeroes --- 1,989 discrete-columns --- l152lav.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.064 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 1989 columns and 97 rows. 1989 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 4656.36 - 0.03 seconds 1 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 1 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 97 rows, 1988 columns (1988 integer) and 9918 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 8.43101 --> up = 2 , down = 1 Pass 2: obj. 6.63359 --> up = 0 , down = 0 -- rand = 20 ( 20) Pass 3: obj. 11.00000 --> up = 2 , down = 8 Pass 4: obj. 3.27273 --> up = 2 , down = 1 Pass 5: obj. 0.57971 --> up = 0 , down = 0 -- rand = 10 ( 16) - solution found of 5157 Before mini branch and bound, 1888 integers at bound fixed and 0 continuous Full problem 97 rows 1988 columns, reduced to 54 rows 87 columns Mini branch and bound improved solution from 5157 to 5044 (0.10 seconds) Round again with cutoff of 5005.24 Reduced cost fixing fixed 1 variables on pass 2 Pass 6: obj. 8.43101 --> up = 2 , down = 1 Pass 7: obj. 6.63359 --> up = 0 , down = 0 -- rand = 24 ( 24) Pass 8: obj. 12.00000 --> up = 2 , down = 8 Pass 9: obj. 3.68966 --> up = 2 , down = 1 Pass 10: obj. 1.51724 --> up = 0 , down = 0 -- rand = 16 ( 26) Pass 11: obj. 12.08729 --> up = 4 , down = 7 Pass 12: obj. 4.51212 --> up = 1 , down = 1 Pass 13: obj. 3.39604 --> up = 2 , down = 1 perturbation applied Pass 14: obj. 277.89915 --> up = 2 , down = 278 Pass 15: obj. 5.09442 --> up = 4 , down = 0 Pass 16: obj. 3.44287 --> up = 0 , down = 0 -- rand = 27 ( 27) Pass 17: obj. 21.00000 --> up = 8 , down = 13 - solution found of 5005 Before mini branch and bound, 1777 integers at bound fixed and 0 continuous Full problem 97 rows 1988 columns, reduced to 81 rows 193 columns Mini branch and bound improved solution from 5005 to 4787 (0.40 seconds) After 0.40 seconds - Feasibility pump exiting - took 0.40 seconds Full problem 97 rows 1988 columns, reduced to 48 rows 386 columns Integer solution of 4787 found by feasibility pump after 0 iterations and 0 nodes (0.47 seconds) 1 added rows had average density of 4 At root node, 1 cuts changed objective from 4656.36 to 4656.36 in 2 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 3 (Clique) - 6 row cuts (1 active), 0 column cuts in 0.000 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.000 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) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 After 0 nodes, 1 on tree, 4787 best solution, best possible 4656.36 (0.78 seconds) Strong branching is fixing too many variables, too expensively! Full problem 97 rows 1988 columns, reduced to 51 rows 58 columns Full problem 97 rows 1988 columns, reduced to 38 rows 46 columns After 1000 nodes, 202 on tree, 4734 best solution, best possible 4706.66 (20.39 seconds) Full problem 97 rows 1988 columns, reduced to 56 rows 74 columns Full problem 97 rows 1988 columns, reduced to 59 rows 79 columns Search completed - best objective 4722, took 30961 iterations and 1678 nodes (23.30 seconds) Strong branching done 9688 times (202784 iterations), fathomed 185 nodes and fixed 2119 variables Maximum depth 46, 120617 variables fixed on reduced cost Cuts at root node changed objective from 4656.36 to 4656.36 Probing was tried 112 times and created 5 cuts of which 13 were active after adding rounds of cuts (0.188 seconds) Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Knapsack was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Clique was tried 280 times and created 481 cuts of which 111 were active after adding rounds of cuts (0.052 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 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 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Result - Finished objective 4722 after 1678 nodes and 30961 iterations - took 23.78 seconds (total time 23.81) Total time 23.82 Solved to optimality. Writing solution. Objective: 4722 Time: 23.83 s --- Restarting execution --- l152lav.gms(124) 0 Mb --- Reading solution for model m --- l152lav.gms(124) 3 Mb *** Status: Normal completion --- Job l152lav.gms Stop 08/21/08 08:03:49 elapsed 0:00:24.069