--- Job ran10x10b Start 07/18/08 15:09:39
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
--- ran10x10b.gms(106) 2 Mb
--- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10b.gdx
--- ran10x10b.gms(148) 3 Mb
--- Starting execution: elapsed 0:00:00.020
--- ran10x10b.gms(123) 4 Mb
--- Generating MIP model m
--- ran10x10b.gms(124) 4 Mb
---   121 rows  201 columns  601 non-zeroes
---   100 discrete-columns
--- Executing Cbc: elapsed 0:00:00.025

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: 200 columns and 120 rows.
                    100 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 2613.47 - 0.00 seconds
processed model has 120 rows, 200 columns (100 integer) and 400 elements
Pass   1: suminf.    1.06873 obj. 2766.1 iterations 30
Solution found of 3232
Before mini branch and bound, 95 integers at bound fixed and 95 continuous
Full problem 120 rows 200 columns, reduced to 0 rows 0 columns
Mini branch and bound did not improve solution (0.00 seconds)
After 0.00 seconds - Feasibility pump exiting with objective of 3 - took 0.00 seconds
Integer solution of 3232 found by feasibility pump after 0 iterations and 0 nodes (0.00 seconds)
Full problem 120 rows 200 columns, reduced to 0 rows 0 columns
29 added rows had average density of 82.3448
At root node, 29 cuts changed objective from 2613.47 to 2997.62 in 100 passes
Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts  in 1.656 seconds - new frequency is 10
Cut generator 1 (Gomory) - 346 row cuts (12 active), 0 column cuts  in 0.064 seconds - new frequency is 1
Cut generator 2 (Knapsack) - 283 row cuts (6 active), 0 column cuts  in 0.072 seconds - new frequency is 1
Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts  in -0.000 seconds - new frequency is -100
Cut generator 4 (MixedIntegerRounding2) - 118 row cuts (5 active), 0 column cuts  in 0.028 seconds - new frequency is 1
Cut generator 5 (FlowCover) - 64 row cuts (4 active), 0 column cuts  in 0.148 seconds - new frequency is -100
Cut generator 6 (TwoMirCuts) - 221 row cuts (2 active), 0 column cuts  in 0.044 seconds - new frequency is -100
After 0 nodes, 1 on tree, 3232 best solution, best possible 2997.62 (2.25 seconds)
Cbc0004I Integer solution of 3073 found after 2116 iterations and 32 nodes (3.02 seconds)
Cbc0038I Full problem 120 rows 200 columns, reduced to 6 rows 7 columns
Cbc0038I Full problem 120 rows 200 columns, reduced to 0 rows 0 columns

Solved to optimality.
wallclocktime:  2.82204 	 used seconds:  3.22
MIP solution:                  3073   (52 nodes, 3.22 seconds)
Best possible:                 3073
Absolute gap:                     0   (absolute tolerance optca: 0)
Relative gap:                     0   (relative tolerance optcr: 0)
--- Restarting execution
--- ran10x10b.gms(124) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job ran10x10b.gms Stop 07/18/08 15:09:41 elapsed 0:00:02.870