--- Job bal8x12 Start 08/21/08 18:07:31 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 --- bal8x12.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/bal8x12.gdx --- bal8x12.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- bal8x12.gms(123) 4 Mb --- Generating MIP model m --- bal8x12.gms(124) 4 Mb --- 117 rows 193 columns 577 non-zeroes --- 96 discrete-columns --- Executing COINCBC: elapsed 0:00:00.010 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 192 columns and 116 rows. 96 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 451.188 - -0.00 seconds processed model has 116 rows, 192 columns (96 integer) and 384 elements Pass 1: suminf. 0.93571 obj. 484.429 iterations 39 Pass 2: suminf. 0.53571 obj. 492.429 iterations 16 Solution found of 515.25 Before mini branch and bound, 88 integers at bound fixed and 88 continuous Full problem 116 rows 192 columns, reduced to 8 rows 9 columns Mini branch and bound improved solution from 515.25 to 504.55 (0.01 seconds) Freeing continuous variables gives a solution of 504.55 Round again with cutoff of 499.214 Pass 3: suminf. 1.43571 obj. 475.429 iterations 55 Pass 4: suminf. 0.86905 obj. 482.229 iterations 19 Pass 5: suminf. 0.80734 obj. 499.214 iterations 43 Pass 6: suminf. 1.01127 obj. 499.214 iterations 21 Pass 7: suminf. 1.12899 obj. 499.214 iterations 22 Pass 8: suminf. 1.06575 obj. 499.214 iterations 28 Pass 9: suminf. 1.25399 obj. 499.214 iterations 23 Pass 10: suminf. 1.04901 obj. 499.214 iterations 20 Pass 11: suminf. 1.25399 obj. 499.214 iterations 19 Pass 12: suminf. 2.89095 obj. 499.214 iterations 28 Pass 13: suminf. 2.35277 obj. 499.214 iterations 8 Pass 14: suminf. 1.90024 obj. 499.214 iterations 14 Pass 15: suminf. 2.33310 obj. 499.214 iterations 24 Pass 16: suminf. 2.40329 obj. 499.214 iterations 39 Pass 17: suminf. 1.96944 obj. 499.214 iterations 20 Pass 18: suminf. 1.16552 obj. 499.214 iterations 25 Pass 19: suminf. 1.70801 obj. 499.214 iterations 38 Pass 20: suminf. 1.39919 obj. 499.214 iterations 15 Pass 21: suminf. 1.49746 obj. 499.214 iterations 19 Pass 22: suminf. 1.49746 obj. 499.214 iterations 3 Before mini branch and bound, 69 integers at bound fixed and 74 continuous Full problem 116 rows 192 columns, reduced to 31 rows 39 columns Mini branch and bound improved solution from 504.55 to 496.85 (0.04 seconds) After 0.04 seconds - Feasibility pump exiting with objective of 496.85 - took 0.04 seconds Integer solution of 496.85 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Full problem 116 rows 192 columns, reduced to 0 rows 0 columns 22 added rows had average density of 16.5 At root node, 22 cuts changed objective from 451.188 to 468.658 in 20 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.100 seconds - new frequency is 10 Cut generator 1 (Gomory) - 47 row cuts (1 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 45 row cuts (3 active), 0 column cuts in 0.024 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) - 33 row cuts (3 active), 0 column cuts in 0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 26 row cuts (8 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 134 row cuts (2 active), 0 column cuts in 0.020 seconds - new frequency is -100 After 0 nodes, 1 on tree, 496.85 best solution, best possible 468.658 (0.24 seconds) Search completed - best objective 471.55, took 263 iterations and 2 nodes (0.26 seconds) Strong branching done 60 times (563 iterations), fathomed 1 nodes and fixed 0 variables Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 451.188 to 468.658 Probing was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.100 seconds) Gomory was tried 21 times and created 47 cuts of which 1 were active after adding rounds of cuts (0.008 seconds) Knapsack was tried 21 times and created 48 cuts of which 3 were active after adding rounds of cuts (0.028 seconds) Clique was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 21 times and created 35 cuts of which 4 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 20 times and created 26 cuts of which 8 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 20 times and created 134 cuts of which 2 were active after adding rounds of cuts (0.020 seconds) Result - Finished objective 471.55 after 2 nodes and 263 iterations - took 0.26 seconds (total time 0.26) Total time 0.26 Solved to optimality. MIP solution: 471.55 (2 nodes, 0.26 seconds) Best possible: 471.55 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- bal8x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bal8x12.gms Stop 08/21/08 18:07:31 elapsed 0:00:00.299