--- Job l152lav Start 08/21/08 22:03:28 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 --- 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.014 --- 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.045 GAMS/CoinCbc 2.1 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.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 4656.36 - 0.04 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: suminf. 8.15306 obj. 4778.7 iterations 131 Pass 2: suminf. 6.85289 obj. 4752.58 iterations 49 Pass 3: suminf. 0.00000 obj. 4990 iterations 136 Solution found of 4990 Before mini branch and bound, 1903 integers at bound fixed and 0 continuous Full problem 97 rows 1988 columns, reduced to 39 rows 59 columns Mini branch and bound improved solution from 4990 to 4975 (0.09 seconds) Round again with cutoff of 4943.14 Reduced cost fixing fixed 47 variables on major pass 2 Pass 4: suminf. 8.30612 obj. 4769.97 iterations 125 Pass 5: suminf. 7.57778 obj. 4742.14 iterations 25 Pass 6: suminf. 7.06667 obj. 4741.89 iterations 2 Pass 7: suminf. 3.00000 obj. 4800 iterations 87 Pass 8: suminf. 1.75000 obj. 4779.81 iterations 122 Pass 9: suminf. 0.19088 obj. 4943.14 iterations 351 Solution found of 4935 Before mini branch and bound, 1893 integers at bound fixed and 0 continuous Full problem 97 rows 1988 columns, reduced to 46 rows 73 columns Mini branch and bound did not improve solution (0.24 seconds) After 0.24 seconds - Feasibility pump exiting with objective of 11 - took 0.23 seconds Integer solution of 4990 found by feasibility pump after 0 iterations and 0 nodes (0.24 seconds) Full problem 97 rows 1988 columns, reduced to 0 rows 0 columns At root node, 0 cuts changed objective from 4656.36 to 4656.36 in 1 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.052 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 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, 4990 best solution, best possible 4656.36 (0.71 seconds) Strong branching is fixing too many variables, too expensively! Full problem 97 rows 1988 columns, reduced to 0 rows 0 columns Full problem 97 rows 1988 columns, reduced to 44 rows 44 columns Full problem 97 rows 1988 columns, reduced to 57 rows 68 columns Full problem 97 rows 1988 columns, reduced to 60 rows 81 columns Integer solution of 4734 found after 5073 iterations and 150 nodes (8.58 seconds) Full problem 97 rows 1988 columns, reduced to 63 rows 89 columns Integer solution of 4732 found after 5437 iterations and 167 nodes (9.27 seconds) Full problem 97 rows 1988 columns, reduced to 63 rows 92 columns Full problem 97 rows 1988 columns, reduced to 65 rows 102 columns Search completed - best objective 4722, took 8279 iterations and 358 nodes (11.19 seconds) Strong branching done 4616 times (89182 iterations), fathomed 35 nodes and fixed 434 variables Maximum depth 25, 49403 variables fixed on reduced cost Cuts at root node changed objective from 4656.36 to 4656.36 Probing was tried 24 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.060 seconds) Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Knapsack was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 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 358 nodes and 8279 iterations - took 11.54 seconds (total time 11.58) Total time 11.60 Solved to optimality. MIP solution: 4722 (358 nodes, 11.6 seconds) Best possible: 4722 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- 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 22:03:40 elapsed 0:00:11.755