--- Job p0548 Start 08/21/08 11:33:33 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 --- p0548.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0548.gdx --- p0548.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.010 --- p0548.gms(123) 4 Mb --- Generating MIP model m --- p0548.gms(124) 4 Mb --- 177 rows 549 columns 2,128 non-zeroes --- 548 discrete-columns --- p0548.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.020 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 548 columns and 176 rows. 548 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 315.255 - 0.00 seconds 4 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 4 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 139 rows, 440 columns (440 integer) and 1305 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 0.90488 --> up = 0 , down = 0 -- rand = 24 ( 27) Pass 2: obj. 19.40044 --> up = 20 , down = 0 Pass 3: obj. 0.52277 --> up = 0 , down = 0 -- rand = 11 ( 11) Pass 4: obj. 8.70071 --> up = 9 , down = 0 Pass 5: obj. 0.43614 --> up = 0 , down = 0 -- rand = 19 ( 24) Pass 6: obj. 16.52848 --> up = 17 , down = 0 Pass 7: obj. 0.54323 --> up = 0 , down = 0 -- rand = 20 ( 20) Pass 8: obj. 15.53129 --> up = 16 , down = 0 perturbation applied Pass 9: obj. 22.75536 --> up = 15 , down = 5 Pass 10: obj. 3.40977 --> up = 0 , down = 0 -- rand = 25 ( 25) Pass 11: obj. 9.31361 --> up = 9 , down = 0 Pass 12: obj. 0.76126 --> up = 0 , down = 0 -- rand = 10 ( 10) Pass 13: obj. 6.84536 --> up = 7 , down = 0 Pass 14: obj. 0.20622 --> up = 0 , down = 0 -- rand = 11 ( 14) Pass 15: obj. 9.90994 --> up = 10 , down = 0 Pass 16: obj. 0.38359 --> up = 0 , down = 0 -- rand = 11 ( 11) Pass 17: obj. 6.10766 --> up = 6 , down = 0 Pass 18: obj. 0.44549 --> up = 0 , down = 0 -- rand = 11 ( 11) Pass 19: obj. 8.39622 --> up = 8 , down = 0 Pass 20: obj. 0.76126 --> No solution found this major pass Before mini branch and bound, 307 integers at bound fixed and 0 continuous Mini branch and bound did not improve solution (0.02 seconds) Full problem 140 rows 440 columns, reduced to 140 rows 440 columns - too large After 0.06 seconds - Feasibility pump exiting - took 0.05 seconds 98 added rows had average density of 19.5612 At root node, 98 cuts changed objective from 539.158 to 8690.05 in 11 passes Cut generator 0 (Probing) - 80 row cuts (13 active), 2 column cuts in 0.056 seconds - new frequency is 1 Cut generator 1 (Gomory) - 109 row cuts (9 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 313 row cuts (49 active), 0 column cuts in 0.020 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) - 58 row cuts (9 active), 0 column cuts in 0.004 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) - 178 row cuts (18 active), 0 column cuts in 0.028 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 8690.05 (0.25 seconds) Integer solution of 9236 found by rounding after 387 iterations and 3 nodes (0.32 seconds) Integer solution of 8702 found by rounding after 436 iterations and 12 nodes (0.47 seconds) Full problem 139 rows 440 columns, reduced to 12 rows 33 columns Integer solution of 8691 found by combine solutions after 490 iterations and 23 nodes (0.50 seconds) Search completed - best objective 8691, took 490 iterations and 23 nodes (0.50 seconds) Strong branching done 288 times (1402 iterations), fathomed 1 nodes and fixed 2 variables Maximum depth 7, 456 variables fixed on reduced cost Cuts at root node changed objective from 539.158 to 8690.05 Probing was tried 25 times and created 85 cuts of which 16 were active after adding rounds of cuts (0.076 seconds) Gomory was tried 25 times and created 110 cuts of which 10 were active after adding rounds of cuts (0.024 seconds) Knapsack was tried 25 times and created 328 cuts of which 54 were active after adding rounds of cuts (0.028 seconds) Clique was tried 11 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 11 times and created 58 cuts of which 9 were active after adding rounds of cuts (0.004 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 11 times and created 178 cuts of which 18 were active after adding rounds of cuts (0.028 seconds) Result - Finished objective 8691 after 23 nodes and 490 iterations - took 0.58 seconds (total time 0.58) Total time 0.58 Solved to optimality. Writing solution. Objective: 8691 Time: 0.58 s --- Restarting execution --- p0548.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0548.gms Stop 08/21/08 11:33:34 elapsed 0:00:00.640