--- Job bal8x12 Start 08/23/08 22:42:48 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 --- 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.006 --- 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 Cbc: elapsed 0:00:00.010 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 451.188 - -0.00 seconds Optimal - objective value 451.188 processed model has 116 rows, 192 columns (96 integer) and 384 elements Pass 1: suminf. 0.93571 (3) obj. 484.429 iterations 43 Pass 2: suminf. 0.53571 (2) obj. 492.429 iterations 13 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.00 seconds) Round again with cutoff of 499.214 Pass 3: suminf. 1.43571 (4) obj. 475.429 iterations 63 Pass 4: suminf. 0.86905 (3) obj. 482.229 iterations 22 Pass 5: suminf. 0.80734 (3) obj. 499.214 iterations 45 Pass 6: suminf. 1.01127 (3) obj. 499.214 iterations 21 Pass 7: suminf. 1.12899 (3) obj. 499.214 iterations 18 Pass 8: suminf. 1.06575 (4) obj. 499.214 iterations 27 Pass 9: suminf. 1.25399 (4) obj. 499.214 iterations 17 Pass 10: suminf. 1.04901 (3) obj. 499.214 iterations 24 Pass 11: suminf. 1.25399 (3) obj. 499.214 iterations 16 Pass 12: suminf. 2.89095 (8) obj. 499.214 iterations 26 Pass 13: suminf. 2.35277 (7) obj. 499.214 iterations 12 Pass 14: suminf. 1.90024 (6) obj. 499.214 iterations 17 Pass 15: suminf. 2.33309 (6) obj. 499.214 iterations 21 Pass 16: suminf. 2.40329 (7) obj. 499.214 iterations 38 Pass 17: suminf. 1.96944 (6) obj. 499.214 iterations 17 Pass 18: suminf. 1.16552 (5) obj. 499.214 iterations 17 Pass 19: suminf. 1.70801 (5) obj. 499.214 iterations 29 Pass 20: suminf. 1.39919 (5) obj. 499.214 iterations 16 Pass 21: suminf. 1.49746 (5) obj. 499.214 iterations 20 Pass 22: suminf. 1.49746 (5) obj. 499.214 iterations 2 No solution found this major pass Before mini branch and bound, 68 integers at bound fixed and 74 continuous Full problem 116 rows 192 columns, reduced to 31 rows 39 columns Mini branch and bound did not improve solution (0.03 seconds) After 0.03 seconds - Feasibility pump exiting with objective of 504.55 - took 0.03 seconds Integer solution of 504.55 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) Full problem 116 rows 192 columns, reduced to 0 rows 0 columns 18 added rows had average density of 103 At root node, 18 cuts changed objective from 451.188 to 471.135 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 1.528 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 2109 row cuts, 0 column cuts (16 active) in 0.088 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 267 row cuts, 0 column cuts (2 active) in 0.044 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 99 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 148 row cuts, 0 column cuts (0 active) in 0.156 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 171 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Optimal - objective value 471.135 Optimal - objective value 471.135 After 0 nodes, 1 on tree, 504.55 best solution, best possible 471.135 (2.13 seconds) Full problem 116 rows 192 columns, reduced to 20 rows 23 columns Search completed - best objective 471.55, took 2274 iterations and 28 nodes (2.54 seconds) Strong branching done 818 times (8365 iterations), fathomed 3 nodes and fixed 7 variables Maximum depth 7, 269 variables fixed on reduced cost Cuts at root node changed objective from 451.188 to 471.135 Probing was tried 108 times and created 11 cuts of which 1 were active after adding rounds of cuts (1.540 seconds) Gomory was tried 133 times and created 2125 cuts of which 20 were active after adding rounds of cuts (0.092 seconds) Knapsack was tried 136 times and created 344 cuts of which 27 were active after adding rounds of cuts (0.052 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 100 times and created 99 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) FlowCover was tried 136 times and created 188 cuts of which 11 were active after adding rounds of cuts (0.184 seconds) TwoMirCuts was tried 100 times and created 171 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) Result - Finished objective 471.55 after 28 nodes and 2274 iterations - took 2.55 seconds (total time 2.55) Total time 2.56 Solved to optimality. MIP solution: 471.55 (28 nodes, 2.56 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/23/08 22:42:50 elapsed 0:00:02.605