--- Job gr4x6 Start 08/21/08 21:59:39 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- gr4x6.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gr4x6.gdx --- gr4x6.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- gr4x6.gms(123) 4 Mb --- Generating MIP model m --- gr4x6.gms(124) 4 Mb --- 35 rows 49 columns 145 non-zeroes --- 24 discrete-columns --- Executing COINCBC: elapsed 0:00:00.008 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 48 columns and 34 rows. 24 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 185.55 - -0.00 seconds processed model has 34 rows, 48 columns (24 integer) and 96 elements Pass 1: suminf. 1.50000 obj. 189.217 iterations 8 Solution found of 229.05 Before mini branch and bound, 19 integers at bound fixed and 19 continuous Full problem 34 rows 48 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 4 - took -0.00 seconds Integer solution of 229.05 found by feasibility pump after 0 iterations and 0 nodes (-0.00 seconds) Full problem 34 rows 48 columns, reduced to 0 rows 0 columns 13 added rows had average density of 20.5385 At root node, 13 cuts changed objective from 185.55 to 202.35 in 5 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is 10 Cut generator 1 (Gomory) - 23 row cuts (1 active), 0 column cuts in 0.000 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 15 row cuts (2 active), 0 column cuts in 0.000 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) - 11 row cuts (5 active), 0 column cuts in 0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 4 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 26 row cuts (5 active), 0 column cuts in 0.004 seconds - new frequency is -100 Integer solution of 202.35 found after 46 iterations and 0 nodes (0.01 seconds) Search completed - best objective 202.35, took 46 iterations and 0 nodes (0.01 seconds) Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 185.55 to 202.35 Probing was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 5 times and created 23 cuts of which 1 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 5 times and created 15 cuts of which 2 were active after adding rounds of cuts (0.000 seconds) Clique was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 5 times and created 11 cuts of which 5 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 5 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 5 times and created 26 cuts of which 5 were active after adding rounds of cuts (0.004 seconds) Result - Finished objective 202.35 after 0 nodes and 46 iterations - took 0.02 seconds (total time 0.02) Total time 0.02 Solved to optimality. MIP solution: 202.35 (0 nodes, 0.02 seconds) Best possible: 202.35 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- gr4x6.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gr4x6.gms Stop 08/21/08 21:59:39 elapsed 0:00:00.047