--- Job mod008 Start 08/21/08 09:31:45 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 --- mod008.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod008.gdx --- mod008.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.031 --- mod008.gms(123) 4 Mb --- Generating MIP model m --- mod008.gms(124) 4 Mb --- 7 rows 320 columns 1,563 non-zeroes --- 319 discrete-columns --- Executing COINCBC: elapsed 0:00:00.037 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 319 columns and 6 rows. 319 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 290.931 - 0.00 seconds processed model has 6 rows, 319 columns (319 integer) and 1243 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 0.05050 --> up = 0 , down = 0 -- rand = 1 ( 14) - solution found of 385 Before mini branch and bound, 313 integers at bound fixed and 0 continuous Full problem 6 rows 319 columns, reduced to 5 rows 6 columns Mini branch and bound improved solution from 385 to 308 (0.00 seconds) Round again with cutoff of 306.293 Reduced cost fixing fixed 183 variables on pass 2 Pass 2: obj. 0.11322 --> up = 0 , down = 0 -- rand = 2 ( 13) Pass 3: obj. 1.11820 --> up = 0 , down = 0 -- rand = 4 ( 11) Pass 4: obj. 1.65009 --> up = 1 , down = 1 perturbation applied Pass 5: obj. 25.00222 --> up = 0 , down = 25 Pass 6: obj. 0.75272 --> up = 0 , down = 0 -- rand = 4 ( 21) Pass 7: obj. 2.12415 --> up = 1 , down = 0 Pass 8: obj. 1.13637 --> up = 0 , down = 0 -- rand = 5 ( 23) Pass 9: obj. 2.77495 --> up = 0 , down = 2 Pass 10: obj. 0.77495 --> up = 0 , down = 0 -- rand = 3 ( 27) perturbation applied Pass 11: obj. 33.02871 --> up = 0 , down = 33 Pass 12: obj. 0.33289 --> up = 0 , down = 0 -- rand = 4 ( 12) Pass 13: obj. 2.69160 --> up = 1 , down = 1 Pass 14: obj. 0.71497 --> up = 0 , down = 0 -- rand = 4 ( 16) Pass 15: obj. 2.23674 --> up = 1 , down = 1 Pass 16: obj. 0.73015 --> up = 0 , down = 0 -- rand = 4 ( 16) Pass 17: obj. 2.26217 --> up = 1 , down = 0 Pass 18: obj. 1.62571 --> up = 0 , down = 1 Pass 19: obj. 1.13961 --> up = 0 , down = 0 -- rand = 5 ( 28) Pass 20: obj. 2.74141 --> up = 1 , down = 2 Pass 21: obj. 0.10717 --> No solution found this major pass Before mini branch and bound, 297 integers at bound fixed and 0 continuous Full problem 6 rows 319 columns, reduced to 6 rows 22 columns Mini branch and bound did not improve solution (0.04 seconds) After 0.04 seconds - Feasibility pump exiting - took 0.04 seconds Integer solution of 308 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Full problem 6 rows 319 columns, reduced to 2 rows 2 columns Integer solution of 307 found by combine solutions after 1814 iterations and 0 nodes (1.20 seconds) 16 added rows had average density of 245.438 At root node, 16 cuts changed objective from 290.931 to 302.49 in 100 passes Cut generator 0 (Probing) - 1 row cuts (1 active), 0 column cuts in 0.772 seconds - new frequency is 10 Cut generator 1 (Gomory) - 887 row cuts (7 active), 0 column cuts in 0.156 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 290 row cuts (1 active), 0 column cuts in 0.048 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) - 369 row cuts (7 active), 0 column cuts in 0.064 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) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 After 0 nodes, 1 on tree, 307 best solution, best possible 302.49 (1.21 seconds) Search completed - best objective 307, took 3541 iterations and 134 nodes (1.75 seconds) Strong branching done 1868 times (11739 iterations), fathomed 52 nodes and fixed 226 variables Maximum depth 25, 2228 variables fixed on reduced cost Cuts at root node changed objective from 290.931 to 302.49 Probing was tried 112 times and created 10 cuts of which 6 were active after adding rounds of cuts (0.772 seconds) Gomory was tried 100 times and created 887 cuts of which 7 were active after adding rounds of cuts (0.156 seconds) Knapsack was tried 139 times and created 599 cuts of which 49 were active after adding rounds of cuts (0.088 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 100 times and created 369 cuts of which 7 were active after adding rounds of cuts (0.064 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 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) Result - Finished objective 307 after 134 nodes and 3541 iterations - took 1.79 seconds (total time 1.79) Total time 1.79 Solved to optimality. Writing solution. Objective: 307 Time: 1.78 s --- Restarting execution --- mod008.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mod008.gms Stop 08/21/08 09:31:47 elapsed 0:00:01.875