--- Job gt2 Start 08/24/08 02:15:05 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 --- gt2.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gt2.gdx --- gt2.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- gt2.gms(123) 4 Mb --- Generating MIP model m --- gt2.gms(124) 4 Mb --- 30 rows 189 columns 469 non-zeroes --- 188 discrete-columns --- Executing Cbc: elapsed 0:00:00.009 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 188 columns and 29 rows. 188 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 13460.2 - 0.00 seconds Optimal - objective value 13460.2 0 fixed, 11 tightened bounds, 10 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 10 strengthened rows, 0 substitutions processed model has 28 rows, 173 columns (173 integer) and 346 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 10 added rows had average density of 59 At root node, 10 cuts changed objective from 17001.9 to 21166 in 34 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.672 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 278 row cuts, 0 column cuts (10 active) in 0.008 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 59 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 207 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Optimal - objective value 21166 Optimal - objective value 21166 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 21166 (0.74 seconds) Integer solution of 21166 found after 277 iterations and 2 nodes (0.75 seconds) Search completed - best objective 21166, took 277 iterations and 2 nodes (0.75 seconds) Strong branching done 12 times (26 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 1, 0 variables fixed on reduced cost Cuts at root node changed objective from 17001.9 to 21166 Probing was tried 34 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.672 seconds) Gomory was tried 36 times and created 278 cuts of which 10 were active after adding rounds of cuts (0.008 seconds) Knapsack was tried 34 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Clique was tried 34 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 36 times and created 59 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 34 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) TwoMirCuts was tried 34 times and created 207 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) implication was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 21166 after 2 nodes and 277 iterations - took 0.76 seconds (total time 0.76) Total time 0.76 Solved to optimality. MIP solution: 21166 (2 nodes, 0.76 seconds) Best possible: 21166 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- gt2.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gt2.gms Stop 08/24/08 02:15:05 elapsed 0:00:00.793