--- Job p0548 Start 07/18/08 15:00: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 --- p0548.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0548.gdx --- p0548.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.008 --- p0548.gms(123) 4 Mb --- Generating MIP model m --- p0548.gms(124) 4 Mb --- 177 rows 549 columns 2,128 non-zeroes --- 548 discrete-columns --- p0548.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.019 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: 548 columns and 176 rows. 548 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 315.255 - 0.00 seconds 17 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 17 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 143 rows, 459 columns (459 integer) and 1338 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 0.62216 obj. 587 iterations 41 Pass 2: suminf. 0.70660 obj. 1014 iterations 32 Pass 3: suminf. 0.52577 obj. 1014 iterations 25 Pass 4: suminf. 0.63004 obj. 1014 iterations 28 Pass 5: suminf. 0.49180 obj. 1014 iterations 25 Pass 6: suminf. 0.50103 obj. 1014 iterations 28 Pass 7: suminf. 0.43914 obj. 1014 iterations 25 Pass 8: suminf. 0.50103 obj. 1014 iterations 26 Pass 9: suminf. 3.13161 obj. 24887.7 iterations 114 Pass 10: suminf. 2.88161 obj. 24887.7 iterations 4 Pass 11: suminf. 0.31376 obj. 35889 iterations 63 Pass 12: suminf. 0.26949 obj. 35889 iterations 22 Pass 13: suminf. 0.34292 obj. 35889 iterations 24 Pass 14: suminf. 0.34292 obj. 35889 iterations 1 Pass 15: suminf. 0.31376 obj. 35889 iterations 22 Pass 16: suminf. 1.66071 obj. 42384.5 iterations 107 Pass 17: suminf. 1.05501 obj. 42331 iterations 33 Pass 18: suminf. 0.63328 obj. 43375.2 iterations 28 Pass 19: suminf. 0.59766 obj. 43355.1 iterations 6 Pass 20: suminf. 1.01649 obj. 43377.4 iterations 34 No solution found this major pass Before mini branch and bound, 273 integers at bound fixed and 0 continuous Mini branch and bound did not improve solution (0.04 seconds) Full problem 144 rows 459 columns, reduced to 143 rows 458 columns - too large After 0.08 seconds - Feasibility pump exiting - took 0.08 seconds 103 added rows had average density of 9.31068 At root node, 103 cuts changed objective from 539.158 to 8690.15 in 12 passes Cut generator 0 (Probing) - 113 row cuts (20 active), 1 column cuts in 0.112 seconds - new frequency is 1 Cut generator 1 (Gomory) - 17 row cuts (3 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 352 row cuts (44 active), 0 column cuts in 0.024 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 59 row cuts (10 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 205 row cuts (26 active), 0 column cuts in 0.024 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 8690.15 (0.33 seconds) Thread 0 used 2 times, waiting to start 0.0322958, 0.060004 cpu time, 14 locks, 0.000286296 locked, 2.26203e-05 waiting for locks Thread 1 used 1 times, waiting to start 0.0264915, 0.064004 cpu time, 8 locks, 0.000163925 locked, 0.000107388 waiting for locks Main thread 0.0735849 waiting for threads, 15 locks, 0.000153519 locked, 0.000119226 waiting for locks Search completed - best objective 8691, took 449 iterations and 3 nodes (0.42 seconds) Strong branching done 200 times (1268 iterations), fathomed 1 nodes and fixed 0 variables Maximum depth 1, 0 variables fixed on reduced cost Cuts at root node changed objective from 539.158 to 8690.15 Probing was tried 39 times and created 341 cuts of which 61 were active after adding rounds of cuts (0.344 seconds) Gomory was tried 36 times and created 51 cuts of which 9 were active after adding rounds of cuts (0.012 seconds) Knapsack was tried 39 times and created 1090 cuts of which 140 were active after adding rounds of cuts (0.076 seconds) Clique was tried 36 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) MixedIntegerRounding2 was tried 36 times and created 177 cuts of which 30 were active after adding rounds of cuts (0.024 seconds) FlowCover was tried 36 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 36 times and created 615 cuts of which 78 were active after adding rounds of cuts (0.072 seconds) Result - Finished objective 8691 after 3 nodes and 449 iterations - took 0.48 seconds (total time 0.48) Total time 0.49 Solved to optimality. wallclocktime: 0.480443 used seconds: 0.49 MIP solution: 8691 (3 nodes, 0.49 seconds) Best possible: 8691 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- p0548.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0548.gms Stop 07/18/08 15:00:57 elapsed 0:00:00.526