--- Job dano3_4 Start 08/21/08 20:10:15 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 --- dano3_4.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dano3_4.gdx --- dano3_4.gms(148) 6 Mb --- Starting execution: elapsed 0:00:00.069 --- dano3_4.gms(123) 6 Mb --- Generating MIP model m --- dano3_4.gms(124) 10 Mb --- 3,203 rows 13,874 columns 79,657 non-zeroes --- 92 discrete-columns --- dano3_4.gms(124) 10 Mb --- Executing COINCBC: elapsed 0:00:00.282 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 13873 columns and 3202 rows. 92 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 576.232 - 35.62 seconds 0 fixed, 63 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 3139 rows, 13825 columns (92 integer) and 80277 elements Pass 1: (1.32 seconds) suminf. 1.00000 obj. 577.466 iterations 1414 Pass 2: (1.38 seconds) suminf. 1.00000 obj. 577.467 iterations 15 Pass 3: (2.07 seconds) suminf. 0.84278 obj. 578.281 iterations 787 Pass 4: (2.57 seconds) suminf. 0.00000 obj. 578.771 iterations 578 Solution found of 578.771 Before mini branch and bound, 58 integers at bound fixed and 11923 continuous Full problem 3139 rows 13825 columns, reduced to 1865 rows 1641 columns Mini branch and bound improved solution from 578.771 to 576.796 (37.33 seconds) Freeing continuous variables gives a solution of 576.497 Round again with cutoff of 576.47 Reduced cost fixing fixed 1 variables on major pass 2 Pass 5: (41.35 seconds) suminf. 1.00000 obj. 576.47 iterations 1964 Pass 6: (41.39 seconds) suminf. 1.00000 obj. 576.47 iterations 3 Pass 7: (42.20 seconds) suminf. 1.20733 obj. 576.47 iterations 1068 Pass 8: (44.95 seconds) suminf. 0.05810 obj. 576.47 iterations 3630 Pass 9: (48.19 seconds) suminf. 1.05517 obj. 576.47 iterations 4798 Pass 10: (48.37 seconds) suminf. 0.99912 obj. 576.47 iterations 202 Pass 11: (49.86 seconds) suminf. 0.00000 obj. 576.47 iterations 2182 Solution found of 576.47 Before mini branch and bound, 64 integers at bound fixed and 11926 continuous Full problem 3139 rows 13825 columns, reduced to 1785 rows 1691 columns Mini branch and bound improved solution from 576.47 to 576.436 (60.28 seconds) Freeing continuous variables gives a solution of 576.435 After 60.74 seconds - Feasibility pump exiting with objective of 576.435 - took 60.71 seconds Integer solution of 576.435 found by feasibility pump after 0 iterations and 0 nodes (60.76 seconds) Full problem 3139 rows 13825 columns, reduced to 2795 rows 11717 columns - too large 21 added rows had average density of 7.19048 At root node, 21 cuts changed objective from 576.232 to 576.301 in 3 passes Cut generator 0 (Probing) - 23 row cuts (20 active), 3 column cuts in 0.064 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.032 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.064 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 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.204 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 1 row cuts (1 active), 0 column cuts in 0.072 seconds - new frequency is -100 After 0 nodes, 1 on tree, 576.435 best solution, best possible 576.301 (67.11 seconds) Search completed - best objective 576.4352247072036, took 14747 iterations and 52 nodes (116.26 seconds) Strong branching done 242 times (22330 iterations), fathomed 1 nodes and fixed 0 variables Maximum depth 25, 1 variables fixed on reduced cost Cuts at root node changed objective from 576.232 to 576.301 Probing was tried 13 times and created 32 cuts of which 29 were active after adding rounds of cuts (0.140 seconds) Gomory was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.064 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.204 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 1 were active after adding rounds of cuts (0.072 seconds) 63 bounds tightened after postprocessing Result - Finished objective 576.4352247072036 after 52 nodes and 14747 iterations - took 116.72 seconds (total time 152.35) Total time 265.08 Solved to optimality. MIP solution: 576.4352247 (52 nodes, 265.1 seconds) Best possible: 576.4352247 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- dano3_4.gms(124) 0 Mb --- Reading solution for model m --- dano3_4.gms(124) 6 Mb *** Status: Normal completion --- Job dano3_4.gms Stop 08/21/08 20:14:42 elapsed 0:04:26.873