--- Job dano3_5 Start 08/24/08 00:30:55 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_5.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dano3_5.gdx --- dano3_5.gms(148) 6 Mb --- Starting execution: elapsed 0:00:00.103 --- dano3_5.gms(123) 6 Mb --- Generating MIP model m --- dano3_5.gms(124) 10 Mb --- 3,203 rows 13,874 columns 79,657 non-zeroes --- 115 discrete-columns --- dano3_5.gms(124) 10 Mb --- Executing Cbc: elapsed 0:00:00.341 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 13873 columns and 3202 rows. 115 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 - 30.72 seconds Optimal - objective value 576.232 0 fixed, 63 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 3139 rows, 13825 columns (115 integer) and 80277 elements Pass 1: (1.44 seconds) suminf. 1.00000 (11) obj. 579.939 iterations 1451 Pass 2: (1.50 seconds) suminf. 1.00000 (10) obj. 579.936 iterations 15 Pass 3: (2.44 seconds) suminf. 0.98376 (13) obj. 580.996 iterations 933 Pass 4: (3.24 seconds) suminf. 0.00000 (0) obj. 581.423 iterations 791 Solution found of 581.423 Before mini branch and bound, 75 integers at bound fixed and 11814 continuous Full problem 3139 rows 13825 columns, reduced to 1936 rows 1774 columns Mini branch and bound did not improve solution (24.07 seconds) Round again with cutoff of 580.904 Pass 5: (25.46 seconds) suminf. 1.00000 (11) obj. 579.939 iterations 1451 Pass 6: (25.52 seconds) suminf. 1.00000 (10) obj. 579.936 iterations 15 Pass 7: (26.80 seconds) suminf. 2.16355 (19) obj. 580.904 iterations 1290 Pass 8: (27.10 seconds) suminf. 2.00000 (13) obj. 580.904 iterations 269 Pass 9: (27.33 seconds) suminf. 2.00491 (12) obj. 580.904 iterations 238 Pass 10: (31.06 seconds) suminf. 1.34949 (16) obj. 580.904 iterations 3921 Pass 11: (32.39 seconds) suminf. 0.00000 (0) obj. 580.904 iterations 1488 Solution found of 580.904 Before mini branch and bound, 61 integers at bound fixed and 11196 continuous Full problem 3139 rows 13825 columns, reduced to 2278 rows 2466 columns - too large Mini branch and bound did not improve solution (39.39 seconds) After 39.39 seconds - Feasibility pump exiting with objective of 580.904 - took 39.35 seconds Integer solution of 578.842 found by feasibility pump after 0 iterations and 0 nodes (45.78 seconds) Full problem 3139 rows 13825 columns, reduced to 2623 rows 10740 columns - too large 33 added rows had average density of 9.90909 At root node, 33 cuts changed objective from 576.232 to 576.345 in 5 passes Cut generator 0 (Probing) - 33 row cuts, 3 column cuts (33 active) in 0.136 seconds - new frequency is 1 Cut generator 1 (Gomory) - 1 row cuts, 0 column cuts (0 active) in 0.060 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.044 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.040 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.328 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 3 row cuts, 0 column cuts (0 active) in 0.160 seconds - new frequency is -100 Optimal - objective value 576.345 Optimal - objective value 576.345 After 0 nodes, 1 on tree, 578.842 best solution, best possible 576.345 (53.40 seconds) After 100 nodes, 48 on tree, 578.842 best solution, best possible 576.702 (222.04 seconds) Integer solution of 577.48 found after 135336 iterations and 130 nodes (267.03 seconds) Full problem 3139 rows 13825 columns, reduced to 2739 rows 11296 columns - too large Integer solution of 576.925 found after 152088 iterations and 149 nodes (299.28 seconds) After 200 nodes, 9 on tree, 576.925 best solution, best possible 576.744 (437.30 seconds) After 300 nodes, 8 on tree, 576.925 best solution, best possible 576.819 (505.86 seconds) Search completed - best objective 576.9249159565585, took 241274 iterations and 362 nodes (539.52 seconds) Strong branching done 138 times (3292 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 23, 84 variables fixed on reduced cost Cuts at root node changed objective from 576.232 to 576.345 Probing was tried 254 times and created 482 cuts of which 445 were active after adding rounds of cuts (2.408 seconds) Gomory was tried 5 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.060 seconds) Knapsack was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.044 seconds) Clique was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) MixedIntegerRounding2 was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) FlowCover was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.328 seconds) TwoMirCuts was tried 5 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.160 seconds) 63 bounds tightened after postprocessing Result - Finished objective 576.9249159565582 after 362 nodes and 241274 iterations - took 540.00 seconds (total time 570.75) Total time 647.00 Solved to optimality. MIP solution: 576.924916 (362 nodes, 647.03 seconds) Best possible: 576.924916 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- dano3_5.gms(124) 0 Mb --- Reading solution for model m --- dano3_5.gms(124) 6 Mb *** Status: Normal completion --- Job dano3_5.gms Stop 08/24/08 00:41:45 elapsed 0:10:49.349