--- Job l152lav Start 08/24/08 02:46: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 --- 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.016 --- 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 Cbc: elapsed 0:00:00.049 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 4656.36 - 0.04 seconds Optimal - objective value 4656.36 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.86826 (41) obj. 4784.8 iterations 130 Pass 2: suminf. 7.51515 (26) obj. 4749.76 iterations 66 Pass 3: suminf. 7.08000 (29) obj. 4761.54 iterations 45 Pass 4: suminf. 7.10861 (30) obj. 4777.36 iterations 42 Pass 5: suminf. 7.10861 (30) obj. 4777.36 iterations 0 Pass 6: suminf. 7.33333 (32) obj. 4749.5 iterations 79 Pass 7: suminf. 7.33333 (32) obj. 4749.5 iterations 0 Pass 8: suminf. 6.85289 (32) obj. 4751.99 iterations 45 Pass 9: suminf. 7.00260 (31) obj. 4791.91 iterations 29 Pass 10: suminf. 7.08000 (30) obj. 4761.78 iterations 25 Pass 11: suminf. 7.08163 (34) obj. 4815.42 iterations 50 Pass 12: suminf. 7.08163 (34) obj. 4815.42 iterations 0 Pass 13: suminf. 0.00000 (0) obj. 5185 iterations 413 Solution found of 5185 Before mini branch and bound, 1877 integers at bound fixed and 0 continuous Full problem 97 rows 1988 columns, reduced to 59 rows 101 columns Mini branch and bound improved solution from 5185 to 4821 (0.19 seconds) Round again with cutoff of 4803 Reduced cost fixing fixed 428 variables on major pass 2 Pass 14: suminf. 9.54545 (39) obj. 4726.14 iterations 94 Pass 15: suminf. 9.14286 (32) obj. 4748.14 iterations 30 Pass 16: suminf. 7.05405 (38) obj. 4747.45 iterations 38 Pass 17: suminf. 7.15068 (34) obj. 4746.82 iterations 53 Pass 18: suminf. 7.15068 (34) obj. 4746.82 iterations 0 Pass 19: suminf. 10.09530 (44) obj. 4803 iterations 131 Pass 20: suminf. 7.59357 (36) obj. 4803 iterations 190 Pass 21: suminf. 6.93321 (43) obj. 4803 iterations 115 Pass 22: suminf. 7.02581 (46) obj. 4803 iterations 35 Pass 23: suminf. 7.02581 (46) obj. 4803 iterations 0 Pass 24: suminf. 17.19553 (64) obj. 4803 iterations 310 Pass 25: suminf. 11.48501 (45) obj. 4803 iterations 178 Pass 26: suminf. 1.55340 (16) obj. 4803 iterations 101 Pass 27: suminf. 1.54386 (17) obj. 4803 iterations 31 Pass 28: suminf. 1.54386 (17) obj. 4803 iterations 0 Pass 29: suminf. 8.29125 (60) obj. 4803 iterations 141 Pass 30: suminf. 3.33333 (30) obj. 4803 iterations 83 Pass 31: suminf. 3.33333 (30) obj. 4803 iterations 0 Pass 32: suminf. 16.93933 (54) obj. 4803 iterations 126 Pass 33: suminf. 10.42239 (40) obj. 4803 iterations 98 No solution found this major pass Before mini branch and bound, 1762 integers at bound fixed and 0 continuous Full problem 97 rows 1988 columns, reduced to 78 rows 224 columns Mini branch and bound did not improve solution (0.77 seconds) After 0.77 seconds - Feasibility pump exiting with objective of 4821 - took 0.76 seconds Integer solution of 4821 found by feasibility pump after 0 iterations and 0 nodes (0.77 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 column cuts (0 active) in 0.044 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Optimal - objective value 4656.36 Optimal - objective value 4656.36 After 0 nodes, 1 on tree, 4821 best solution, best possible 4656.36 (1.19 seconds) Strong branching is fixing too many variables, too expensively! Full problem 97 rows 1988 columns, reduced to 18 rows 19 columns Integer solution of 4745 found by combine solutions after 1220 iterations and 26 nodes (3.70 seconds) Full problem 97 rows 1988 columns, reduced to 35 rows 42 columns Full problem 97 rows 1988 columns, reduced to 35 rows 42 columns Search completed - best objective 4722, took 4378 iterations and 254 nodes (5.38 seconds) Strong branching done 3096 times (35765 iterations), fathomed 24 nodes and fixed 91 variables Maximum depth 24, 27913 variables fixed on reduced cost Cuts at root node changed objective from 4656.36 to 4656.36 Probing was tried 114 times and created 120 cuts of which 0 were active after adding rounds of cuts (0.136 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 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.004 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) implication was tried 132 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 4722 after 254 nodes and 4378 iterations - took 5.72 seconds (total time 5.76) Total time 5.77 Solved to optimality. MIP solution: 4722 (254 nodes, 5.78 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/24/08 02:46:22 elapsed 0:00:05.893