--- Job rgn Start 08/21/08 12:43:19 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 --- rgn.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/rgn.gdx --- rgn.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- rgn.gms(123) 4 Mb --- Generating MIP model m --- rgn.gms(124) 4 Mb --- 25 rows 181 columns 541 non-zeroes --- 100 discrete-columns --- Executing COINCBC: elapsed 0:00:00.011 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 180 columns and 24 rows. 100 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.00.00, build Mar 20 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 48.8 - -0.00 seconds processed model has 24 rows, 180 columns (100 integer) and 460 elements Pass 1: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 19) - solution found of 403.6 Before mini branch and bound, 85 integers at bound fixed and 53 continuous Full problem 24 rows 180 columns, reduced to 18 rows 30 columns Mini branch and bound improved solution from 403.6 to 279.4 (0.03 seconds) Round again with cutoff of 256.34 Pass 2: obj. 0.95841 --> up = 1 , down = 0 Pass 3: obj. 0.05523 --> up = 0 , down = 0 -- rand = 1 ( 27) Pass 4: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 17) - solution found of 160.8 Before mini branch and bound, 83 integers at bound fixed and 49 continuous Full problem 24 rows 180 columns, reduced to 13 rows 25 columns Mini branch and bound improved solution from 160.8 to 153.6 (0.04 seconds) Freeing continuous variables gives a solution of 153.6 After 0.04 seconds - Feasibility pump exiting - took 0.04 seconds Integer solution of 153.6 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Full problem 24 rows 180 columns, reduced to 20 rows 83 columns 28 added rows had average density of 61.6071 At root node, 28 cuts changed objective from 48.8 to 70.4069 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.364 seconds - new frequency is 10 Cut generator 1 (Gomory) - 1212 row cuts (15 active), 0 column cuts in 0.044 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.048 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 252 row cuts (9 active), 0 column cuts in 0.024 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 97 row cuts (0 active), 0 column cuts in 0.060 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 252 row cuts (4 active), 0 column cuts in 0.024 seconds - new frequency is -100 After 0 nodes, 1 on tree, 153.6 best solution, best possible 70.4069 (0.82 seconds) Full problem 24 rows 180 columns, reduced to 23 rows 86 columns Integer solution of 82.2 found by combine solutions after 2977 iterations and 18 nodes (1.05 seconds) After 1000 nodes, 63 on tree, 82.2 best solution, best possible 78.2689 (3.26 seconds) Search completed - best objective 82.19999923999998, took 12075 iterations and 1362 nodes (3.49 seconds) Strong branching done 3804 times (30785 iterations), fathomed 109 nodes and fixed 238 variables Maximum depth 30, 3281 variables fixed on reduced cost Cuts at root node changed objective from 48.8 to 70.4069 Probing was tried 185 times and created 0 cuts of which 39 were active after adding rounds of cuts (0.392 seconds) Gomory was tried 941 times and created 1686 cuts of which 342 were active after adding rounds of cuts (0.140 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.048 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 941 times and created 923 cuts of which 499 were active after adding rounds of cuts (0.160 seconds) FlowCover was tried 100 times and created 97 cuts of which 0 were active after adding rounds of cuts (0.060 seconds) TwoMirCuts was tried 100 times and created 252 cuts of which 4 were active after adding rounds of cuts (0.024 seconds) Result - Finished objective 82.19999923999998 after 1362 nodes and 12075 iterations - took 3.50 seconds (total time 3.50) Total time 3.50 Solved to optimality. Writing solution. Objective: 82.2 Time: 3.5 s --- Restarting execution --- rgn.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job rgn.gms Stop 08/21/08 12:43:22 elapsed 0:00:03.551