--- Job dano3_3 Start 08/21/08 20:06:45 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_3.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dano3_3.gdx --- dano3_3.gms(148) 6 Mb --- Starting execution: elapsed 0:00:00.079 --- dano3_3.gms(123) 6 Mb --- Generating MIP model m --- dano3_3.gms(124) 10 Mb --- 3,203 rows 13,874 columns 79,657 non-zeroes --- 69 discrete-columns --- dano3_3.gms(124) 10 Mb --- Executing COINCBC: elapsed 0:00:00.292 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 13873 columns and 3202 rows. 69 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 - 34.91 seconds 0 fixed, 63 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 3139 rows, 13825 columns (69 integer) and 80277 elements Pass 1: (0.70 seconds) suminf. 1.00000 obj. 576.721 iterations 689 Pass 2: (0.80 seconds) suminf. 1.00000 obj. 576.732 iterations 76 Pass 3: (1.66 seconds) suminf. 0.41235 obj. 577.911 iterations 941 Pass 4: (2.07 seconds) suminf. 0.00000 obj. 578.33 iterations 397 Solution found of 578.33 Before mini branch and bound, 43 integers at bound fixed and 11941 continuous Full problem 3139 rows 13825 columns, reduced to 1891 rows 1645 columns Mini branch and bound improved solution from 578.33 to 576.646 (24.48 seconds) Freeing continuous variables gives a solution of 576.416 Round again with cutoff of 576.398 Reduced cost fixing fixed 6 variables on major pass 2 Pass 5: (27.96 seconds) suminf. 1.00000 obj. 576.398 iterations 635 Pass 6: (28.00 seconds) suminf. 1.00000 obj. 576.398 iterations 6 Pass 7: (28.66 seconds) suminf. 1.07782 obj. 576.398 iterations 864 Pass 8: (30.20 seconds) suminf. 0.00000 obj. 576.398 iterations 2302 Solution found of 576.398 Before mini branch and bound, 53 integers at bound fixed and 12173 continuous Full problem 3139 rows 13825 columns, reduced to 1634 rows 1413 columns Mini branch and bound improved solution from 576.398 to 576.355 (34.04 seconds) Freeing continuous variables gives a solution of 576.345 After 34.84 seconds - Feasibility pump exiting with objective of 576.345 - took 34.80 seconds Integer solution of 576.345 found by feasibility pump after 0 iterations and 0 nodes (34.86 seconds) Full problem 3139 rows 13825 columns, reduced to 2881 rows 12244 columns - too large 9 added rows had average density of 2 At root node, 9 cuts changed objective from 576.232 to 576.254 in 3 passes Cut generator 0 (Probing) - 10 row cuts (9 active), 1 column cuts in 0.044 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.016 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.024 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.196 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.040 seconds - new frequency is -100 After 0 nodes, 1 on tree, 576.345 best solution, best possible 576.254 (39.35 seconds) Search completed - best objective 576.3446330306433, took 8625 iterations and 24 nodes (64.68 seconds) Strong branching done 138 times (12909 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 11, 7 variables fixed on reduced cost Cuts at root node changed objective from 576.232 to 576.254 Probing was tried 10 times and created 16 cuts of which 15 were active after adding rounds of cuts (0.104 seconds) Gomory was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 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.024 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.196 seconds) TwoMirCuts was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) 63 bounds tightened after postprocessing Result - Finished objective 576.3446330306433 after 24 nodes and 8625 iterations - took 65.14 seconds (total time 100.06) Total time 209.15 Solved to optimality. MIP solution: 576.344633 (24 nodes, 209.15 seconds) Best possible: 576.344633 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- dano3_3.gms(124) 0 Mb --- Reading solution for model m --- dano3_3.gms(124) 6 Mb *** Status: Normal completion --- Job dano3_3.gms Stop 08/21/08 20:10:15 elapsed 0:03:30.339