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

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 1252.74 - 0.00 seconds
processed model has 120 rows, 200 columns (100 integer) and 400 elements
Pass   1: suminf.    1.36795 obj. 1352.31 iterations 23
Solution found of 1736
Before mini branch and bound, 91 integers at bound fixed and 91 continuous
Full problem 120 rows 200 columns, reduced to 0 rows 0 columns
Mini branch and bound did not improve solution (0.01 seconds)
After 0.01 seconds - Feasibility pump exiting with objective of 5 - took 0.01 seconds
Integer solution of 1736 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds)
Full problem 120 rows 200 columns, reduced to 0 rows 0 columns
31 added rows had average density of 80.8387
At root node, 31 cuts changed objective from 1252.74 to 1467.81 in 38 passes
Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts  in 0.672 seconds - new frequency is 10
Cut generator 1 (Gomory) - 100 row cuts (10 active), 0 column cuts  in 0.068 seconds - new frequency is 1
Cut generator 2 (Knapsack) - 59 row cuts (6 active), 0 column cuts  in 0.032 seconds - new frequency is 1
Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts  in 0.004 seconds - new frequency is -100
Cut generator 4 (MixedIntegerRounding2) - 99 row cuts (4 active), 0 column cuts  in 0.004 seconds - new frequency is 1
Cut generator 5 (FlowCover) - 69 row cuts (6 active), 0 column cuts  in 0.056 seconds - new frequency is 1
Cut generator 6 (TwoMirCuts) - 182 row cuts (5 active), 0 column cuts  in 0.024 seconds - new frequency is -100
After 0 nodes, 1 on tree, 1736 best solution, best possible 1467.81 (1.13 seconds)
Cbc0038I Full problem 120 rows 200 columns, reduced to 0 rows 0 columns
Cbc0038I Full problem 120 rows 200 columns, reduced to 22 rows 25 columns

Solved to optimality.
wallclocktime:  1.59987 	 used seconds:  1.88
MIP solution:                  1499   (28 nodes, 1.88 seconds)
Best possible:                 1499
Absolute gap:                     0   (absolute tolerance optca: 0)
Relative gap:                     0   (relative tolerance optcr: 0)
--- Restarting execution
--- ran10x10a.gms(124) 0 Mb
--- Reading solution for model m
*** Status: Normal completion
--- Job ran10x10a.gms Stop 07/18/08 15:09:39 elapsed 0:00:01.633