--- Job mod010 Start 08/21/08 09:31:47 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 --- mod010.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod010.gdx --- mod010.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.021 --- mod010.gms(123) 4 Mb --- Generating MIP model m --- mod010.gms(124) 5 Mb --- 147 rows 2,656 columns 13,859 non-zeroes --- 2,655 discrete-columns --- mod010.gms(124) 5 Mb --- Executing COINCBC: elapsed 0:00:00.060 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 2655 columns and 146 rows. 2655 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 6532.08 - 0.05 seconds 27 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 83 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 144 rows, 2572 columns (2572 integer) and 10760 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 8.00000 --> up = 6 , down = 0 Pass 2: obj. 2.00000 --> up = 2 , down = 0 - solution found of 6736 Before mini branch and bound, 2524 integers at bound fixed and 0 continuous Full problem 144 rows 2572 columns, reduced to 12 rows 16 columns Mini branch and bound improved solution from 6736 to 6662 (0.04 seconds) Round again with cutoff of 6649.01 Reduced cost fixing fixed 1020 variables on pass 2 Pass 3: obj. 9.28571 --> up = 3 , down = 3 Pass 4: obj. 4.43293 --> up = 0 , down = 0 -- rand = 20 ( 24) Pass 5: obj. 15.40432 --> up = 7 , down = 13 perturbation applied Pass 6: obj. 216.32522 --> up = 4 , down = 210 Pass 7: obj. 5.15181 --> up = 1 , down = 0 Pass 8: obj. 4.38858 --> up = 0 , down = 0 -- rand = 19 ( 19) Pass 9: obj. 9.00000 --> up = 3 , down = 3 Pass 10: obj. 3.95410 --> up = 2 , down = 1 Pass 11: obj. 2.14826 --> up = 0 , down = 0 -- rand = 12 ( 12) Pass 12: obj. 5.08271 --> up = 3 , down = 1 Pass 13: obj. 1.62963 --> up = 0 , down = 0 -- rand = 12 ( 12) Pass 14: obj. 7.60000 --> up = 2 , down = 3 Pass 15: obj. 4.42857 --> up = 0 , down = 0 -- rand = 16 ( 16) Pass 16: obj. 11.92066 --> up = 3 , down = 8 Pass 17: obj. 4.00000 --> up = 3 , down = 1 Pass 18: obj. 1.18519 --> up = 0 , down = 0 -- rand = 22 ( 24) Pass 19: obj. 14.44828 --> up = 6 , down = 11 Pass 20: obj. 4.36625 --> up = 0 , down = 1 Pass 21: obj. 4.04938 --> up = 0 , down = 0 -- rand = 12 ( 16) Pass 22: obj. 7.00000 --> No solution found this major pass Before mini branch and bound, 2387 integers at bound fixed and 0 continuous Full problem 144 rows 2572 columns, reduced to 75 rows 146 columns Mini branch and bound improved solution from 6662 to 6554 (0.34 seconds) After 0.34 seconds - Feasibility pump exiting - took 0.34 seconds Full problem 144 rows 2572 columns, reduced to 16 rows 29 columns Integer solution of 6548 found by greedy equality after 0 iterations and 0 nodes (0.38 seconds) At root node, 40 cuts changed objective from 6532.08 to 6532.08 in 1 passes Cut generator 0 (Probing) - 0 row cuts (1 active), 1 column cuts in 0.004 seconds - new frequency is 1 Cut generator 1 (Gomory) - 39 row cuts (39 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in -0.000 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) - 1 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Search completed - best objective 6548, took 0 iterations and 0 nodes (0.42 seconds) Maximum depth 0, 2060 variables fixed on reduced cost Cuts at root node changed objective from 6532.08 to 6532.08 Probing was tried 1 times and created 0 cuts of which 1 were active after adding rounds of cuts (0.004 seconds) Gomory was tried 1 times and created 39 cuts of which 39 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Clique was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 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 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Result - Finished objective 6548 after 0 nodes and 0 iterations - took 1.06 seconds (total time 1.11) Total time 1.12 Solved to optimality. Writing solution. Objective: 6548 Time: 1.12 s --- Restarting execution --- mod010.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mod010.gms Stop 08/21/08 09:31:48 elapsed 0:00:01.234