--- Job bal8x12 Start 08/21/08 02:31:50 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 COINCBC: elapsed 0:00:00.011 GAMS/CoinCbc 2.0 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.00.00, build Mar 20 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: obj. 1.13571 --> up = 1 , down = 0 Pass 2: obj. 0.53571 --> up = 0 , down = 0 -- rand = 2 ( 29) - 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 7 rows 8 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: obj. 1.63571 --> up = 1 , down = 0 Pass 4: obj. 0.86905 --> up = 0 , down = 0 -- rand = 3 ( 14) Pass 5: obj. 0.80734 --> up = 0 , down = 0 -- rand = 3 ( 23) Pass 6: obj. 1.01127 --> up = 0 , down = 0 -- rand = 3 ( 21) Pass 7: obj. 1.87101 --> up = 0 , down = 2 Pass 8: obj. 1.06575 --> up = 1 , down = 0 perturbation applied Pass 9: obj. 16.82126 --> up = 0 , down = 17 Pass 10: obj. 2.45459 --> up = 0 , down = 0 -- rand = 7 ( 20) Pass 11: obj. 3.44983 --> up = 1 , down = 3 Pass 12: obj. 1.65459 --> up = 0 , down = 0 -- rand = 6 ( 23) Pass 13: obj. 3.29548 --> up = 1 , down = 2 Pass 14: obj. 2.00024 --> up = 1 , down = 0 Pass 15: obj. 2.00024 --> up = 0 , down = 0 -- rand = 6 ( 14) Pass 16: obj. 2.94983 --> up = 1 , down = 2 Pass 17: obj. 1.65459 --> up = 1 , down = 0 Pass 18: obj. 1.65459 --> up = 0 , down = 0 -- rand = 6 ( 21) Pass 19: obj. 3.29548 --> up = 1 , down = 2 Pass 20: obj. 2.00024 --> up = 1 , down = 0 Pass 21: obj. 2.00024 --> up = 0 , down = 0 -- rand = 6 ( 21) Pass 22: obj. 2.94983 --> No solution found this major pass Before mini branch and bound, 81 integers at bound fixed and 86 continuous Full problem 116 rows 192 columns, reduced to 13 rows 16 columns Mini branch and bound did not improve solution (0.02 seconds) After 0.02 seconds - Feasibility pump exiting - took 0.02 seconds Integer solution of 504.55 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) Full problem 116 rows 192 columns, reduced to 0 rows 0 columns 17 added rows had average density of 66.1176 At root node, 17 cuts changed objective from 451.188 to 470.73 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.904 seconds - new frequency is 10 Cut generator 1 (Gomory) - 2325 row cuts (6 active), 0 column cuts in 0.068 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 284 row cuts (6 active), 0 column cuts in 0.080 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) - 190 row cuts (5 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 126 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is -100 After 0 nodes, 1 on tree, 504.55 best solution, best possible 470.73 (1.47 seconds) Integer solution of 486.3 found by rounding after 2057 iterations and 11 nodes (1.57 seconds) Full problem 116 rows 192 columns, reduced to 21 rows 25 columns Integer solution of 482.65 found by combine solutions after 2084 iterations and 14 nodes (1.60 seconds) Full problem 116 rows 192 columns, reduced to 29 rows 36 columns Integer solution of 475.55 found by combine solutions after 2152 iterations and 21 nodes (1.66 seconds) Search completed - best objective 471.55, took 2269 iterations and 24 nodes (1.72 seconds) Strong branching done 492 times (4614 iterations), fathomed 6 nodes and fixed 13 variables Maximum depth 6, 303 variables fixed on reduced cost Cuts at root node changed objective from 451.188 to 470.73 Probing was tried 102 times and created 5 cuts of which 2 were active after adding rounds of cuts (0.904 seconds) Gomory was tried 119 times and created 2335 cuts of which 13 were active after adding rounds of cuts (0.068 seconds) Knapsack was tried 100 times and created 284 cuts of which 6 were active after adding rounds of cuts (0.080 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 190 cuts of which 5 were active after adding rounds of cuts (0.020 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 100 times and created 126 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) Result - Finished objective 471.55 after 24 nodes and 2269 iterations - took 1.73 seconds (total time 1.73) Total time 1.73 Solved to optimality. Writing solution. Objective: 471.55 Time: 1.73 s --- Restarting execution --- bal8x12.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bal8x12.gms Stop 08/21/08 02:31:52 elapsed 0:00:01.777