--- Job dano3_4 Start 07/17/08 16:11:56 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.144 --- 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.382 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" 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 Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is 576.232 - 28.76 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.03 seconds) suminf. 1.00000 obj. 577.24 iterations 1101 Pass 2: (1.09 seconds) suminf. 1.00000 obj. 577.237 iterations 15 Pass 3: (1.64 seconds) suminf. 0.52211 obj. 578.565 iterations 540 Pass 4: (1.96 seconds) suminf. 0.00000 obj. 579.283 iterations 293 Solution found of 579.283 Before mini branch and bound, 63 integers at bound fixed and 12010 continuous Full problem 3139 rows 13825 columns, reduced to 1789 rows 1535 columns Mini branch and bound improved solution from 579.283 to 576.725 (73.08 seconds) Freeing continuous variables gives a solution of 576.497 Round again with cutoff of 576.47 Reduced cost fixing fixed 2 variables on major pass 2 Pass 5: (77.45 seconds) suminf. 1.00000 obj. 576.47 iterations 2329 Pass 6: (77.51 seconds) suminf. 1.00000 obj. 576.469 iterations 25 Pass 7: (78.26 seconds) suminf. 1.30957 obj. 576.47 iterations 972 Pass 8: (81.08 seconds) suminf. 0.05810 obj. 576.47 iterations 3602 Pass 9: (84.47 seconds) suminf. 1.05517 obj. 576.47 iterations 4793 Pass 10: (84.61 seconds) suminf. 0.96462 obj. 576.47 iterations 140 Pass 11: (86.47 seconds) suminf. 0.00000 obj. 576.47 iterations 2668 Solution found of 576.47 Before mini branch and bound, 65 integers at bound fixed and 11949 continuous Full problem 3139 rows 13825 columns, reduced to 1746 rows 1665 columns Mini branch and bound improved solution from 576.47 to 576.437 (97.13 seconds) Freeing continuous variables gives a solution of 576.435 After 97.63 seconds - Feasibility pump exiting with objective of 576.435 - took 97.60 seconds Integer solution of 576.435 found by feasibility pump after 0 iterations and 0 nodes (97.65 seconds) Full problem 3139 rows 13825 columns, reduced to 2795 rows 11717 columns - too large 21 added rows had average density of 2.14286 At root node, 21 cuts changed objective from 576.232 to 576.302 in 3 passes Cut generator 0 (Probing) - 22 row cuts (21 active), 3 column cuts in 0.044 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.060 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.008 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.192 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.052 seconds - new frequency is -100 After 0 nodes, 1 on tree, 576.435 best solution, best possible 576.302 (103.88 seconds) Thread 0 used 23 times, waiting to start 3.73984, 48.159 cpu time, 146 locks, 0.0526018 locked, 0.0365084 waiting for locks Thread 1 used 21 times, waiting to start 27.2154, 24.8856 cpu time, 100 locks, 0.0465601 locked, 0.0418884 waiting for locks Main thread 41.7063 waiting for threads, 113 locks, 0.000220917 locked, 0.00017703 waiting for locks Search completed - best objective 576.4352247072039, took 11938 iterations and 44 nodes (155.73 seconds) Strong branching done 270 times (25816 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 21, 3 variables fixed on reduced cost Cuts at root node changed objective from 576.232 to 576.302 Probing was tried 18 times and created 74 cuts of which 71 were active after adding rounds of cuts (0.256 seconds) Gomory was tried 6 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.072 seconds) Knapsack was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.180 seconds) Clique was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) MixedIntegerRounding2 was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.072 seconds) FlowCover was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.576 seconds) TwoMirCuts was tried 6 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.156 seconds) 63 bounds tightened after postprocessing Result - Finished objective 576.4352247072039 after 44 nodes and 11938 iterations - took 156.21 seconds (total time 184.98) Total time 316.40 Solved to optimality. wallclocktime: 307.192 used seconds: 316.42 MIP solution: 576.4352247 (44 nodes, 316.42 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 07/17/08 16:17:04 elapsed 0:05:07.668