--- Job dano3_4 Start 08/24/08 00:27:52 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 --- 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.100 --- 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 Cbc: elapsed 0:00:00.338 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 576.232 - 28.72 seconds Optimal - objective value 576.232 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.18 seconds) suminf. 1.00000 (15) obj. 578.106 iterations 1173 Pass 2: (1.27 seconds) suminf. 1.00000 (10) obj. 578.101 iterations 55 Pass 3: (2.29 seconds) suminf. 0.41233 (15) obj. 578.831 iterations 1021 Pass 4: (2.74 seconds) suminf. 0.00000 (0) obj. 579.52 iterations 413 Solution found of 579.52 Before mini branch and bound, 55 integers at bound fixed and 11837 continuous Full problem 3139 rows 13825 columns, reduced to 1950 rows 1751 columns Mini branch and bound improved solution from 579.52 to 576.795 (19.40 seconds) Freeing continuous variables gives a solution of 576.497 Round again with cutoff of 576.47 Reduced cost fixing fixed 3 variables on major pass 2 Pass 5: (28.29 seconds) suminf. 1.00000 (9) obj. 576.47 iterations 2010 Pass 6: (28.32 seconds) suminf. 1.00000 (9) obj. 576.47 iterations 3 Pass 7: (28.80 seconds) suminf. 1.05599 (10) obj. 576.47 iterations 604 Pass 8: (32.08 seconds) suminf. 2.04575 (12) obj. 576.47 iterations 4417 Pass 9: (33.65 seconds) suminf. 0.66499 (7) obj. 576.47 iterations 2296 Pass 10: (34.99 seconds) suminf. 0.00000 (0) obj. 576.47 iterations 1853 Solution found of 576.47 Before mini branch and bound, 63 integers at bound fixed and 11968 continuous Full problem 3139 rows 13825 columns, reduced to 1775 rows 1645 columns Mini branch and bound improved solution from 576.47 to 576.44 (43.08 seconds) Freeing continuous variables gives a solution of 576.435 After 49.94 seconds - Feasibility pump exiting with objective of 576.435 - took 49.91 seconds Integer solution of 576.435 found by feasibility pump after 0 iterations and 0 nodes (49.96 seconds) 22 added rows had average density of 2.13636 At root node, 22 cuts changed objective from 576.232 to 576.302 in 5 passes Cut generator 0 (Probing) - 23 row cuts, 3 column cuts (22 active) in 0.076 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts, 0 column cuts (0 active) in 0.044 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.048 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.336 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts, 0 column cuts (0 active) in 0.100 seconds - new frequency is -100 Optimal - objective value 576.302 Optimal - objective value 576.302 After 0 nodes, 1 on tree, 576.435 best solution, best possible 576.302 (56.59 seconds) Search completed - best objective 576.4352247072038, took 12318 iterations and 44 nodes (75.59 seconds) Strong branching done 66 times (2609 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 21, 5 variables fixed on reduced cost Cuts at root node changed objective from 576.232 to 576.302 Probing was tried 21 times and created 43 cuts of which 38 were active after adding rounds of cuts (0.220 seconds) Gomory was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.044 seconds) Knapsack was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.048 seconds) Clique was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) FlowCover was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.336 seconds) TwoMirCuts was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.100 seconds) implication was tried 22 times and created 0 cuts of which 0 were active after adding rounds of cuts 63 bounds tightened after postprocessing Result - Finished objective 576.4352247072038 after 44 nodes and 12318 iterations - took 76.06 seconds (total time 104.81) Total time 181.82 Solved to optimality. MIP solution: 576.4352247 (44 nodes, 181.85 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/24/08 00:30:55 elapsed 0:03:03.423