--- Job dcmulti Start 08/21/08 07:01:36 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 --- dcmulti.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dcmulti.gdx --- dcmulti.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.033 --- dcmulti.gms(123) 4 Mb --- Generating MIP model m --- dcmulti.gms(124) 4 Mb --- 291 rows 549 columns 1,834 non-zeroes --- 75 discrete-columns --- dcmulti.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.043 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 548 columns and 290 rows. 75 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 183976 - 0.01 seconds processed model has 224 rows, 500 columns (72 integer) and 1324 elements Pass 1: obj. 4.04715 --> up = 3 , down = 0 Pass 2: obj. 1.04715 --> up = 0 , down = 0 -- rand = 8 ( 17) Pass 3: obj. 0.66667 --> up = 0 , down = 0 -- rand = 2 ( 14) Pass 4: obj. 1.00000 --> up = 0 , down = 0 -- rand = 2 ( 21) perturbation applied Pass 5: obj. 6.15515 --> up = 2 , down = 1 Pass 6: obj. 3.49094 --> up = 3 , down = 1 Pass 7: obj. 0.87805 --> up = 0 , down = 0 -- rand = 2 ( 26) Pass 8: obj. 1.00000 --> up = 0 , down = 1 - solution found of 209853 Before mini branch and bound, 16 integers at bound fixed and 230 continuous Full problem 224 rows 500 columns, reduced to 181 rows 252 columns - too large Mini branch and bound did not improve solution (0.02 seconds) Round again with cutoff of 207271 Pass 9: obj. 4.04715 --> up = 3 , down = 0 Pass 10: obj. 1.04715 --> up = 0 , down = 0 -- rand = 13 ( 15) Pass 11: obj. 4.50000 --> up = 0 , down = 3 Pass 12: obj. 4.00000 --> up = 0 , down = 0 -- rand = 9 ( 10) Pass 13: obj. 3.50000 --> up = 0 , down = 0 -- rand = 9 ( 24) perturbation applied Pass 14: obj. 9.60032 --> up = 5 , down = 2 Pass 15: obj. 3.04143 --> up = 0 , down = 0 -- rand = 13 ( 15) Pass 16: obj. 6.75000 --> up = 3 , down = 4 Pass 17: obj. 2.36429 --> up = 0 , down = 3 Pass 18: obj. 1.86429 --> up = 0 , down = 0 -- rand = 7 ( 12) Pass 19: obj. 4.50000 --> up = 3 , down = 1 perturbation applied Pass 20: obj. 6.70714 --> up = 3 , down = 3 Pass 21: obj. 1.66429 --> up = 0 , down = 0 -- rand = 6 ( 13) Pass 22: obj. 2.66667 --> up = 3 , down = 0 Pass 23: obj. 1.41667 --> up = 0 , down = 0 -- rand = 5 ( 12) Pass 24: obj. 3.00000 --> up = 3 , down = 0 Pass 25: obj. 1.75000 --> up = 1 , down = 0 Pass 26: obj. 0.75000 --> up = 0 , down = 0 -- rand = 3 ( 18) Pass 27: obj. 2.00000 --> up = 3 , down = 0 perturbation applied Pass 28: obj. 8.79421 --> No solution found this major pass Before mini branch and bound, 10 integers at bound fixed and 206 continuous Full problem 224 rows 500 columns, reduced to 182 rows 272 columns - too large Mini branch and bound did not improve solution (0.06 seconds) After 0.06 seconds - Feasibility pump exiting - took 0.06 seconds Integer solution of 199197 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Full problem 224 rows 500 columns, reduced to 127 rows 280 columns Integer solution of 197584 found by combine solutions after 2445 iterations and 0 nodes (2.93 seconds) 51 added rows had average density of 160.922 At root node, 51 cuts changed objective from 184034 to 187098 in 39 passes Cut generator 0 (Probing) - 97 row cuts (2 active), 0 column cuts in 1.560 seconds - new frequency is 1 Cut generator 1 (Gomory) - 1559 row cuts (20 active), 0 column cuts in 0.152 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.032 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 55 row cuts (4 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 9 row cuts (4 active), 0 column cuts in 0.336 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 262 row cuts (21 active), 0 column cuts in 0.044 seconds - new frequency is -100 After 0 nodes, 1 on tree, 197584 best solution, best possible 187098 (3.88 seconds) Integer solution of 197085 found by rounding after 4596 iterations and 35 nodes (5.64 seconds) Full problem 224 rows 500 columns, reduced to 165 rows 432 columns - too large Integer solution of 196786 found by rounding after 5090 iterations and 51 nodes (5.88 seconds) Full problem 224 rows 500 columns, reduced to 172 rows 443 columns - too large Integer solution of 196770 found by rounding after 5111 iterations and 53 nodes (5.90 seconds) Full problem 224 rows 500 columns, reduced to 174 rows 445 columns - too large Integer solution of 188204 found by rounding after 5407 iterations and 61 nodes (6.12 seconds) Full problem 224 rows 500 columns, reduced to 180 rows 451 columns - too large Integer solution of 188202 found by rounding after 5737 iterations and 105 nodes (6.44 seconds) Integer solution of 188201 found after 5739 iterations and 107 nodes (6.45 seconds) Full problem 224 rows 500 columns, reduced to 180 rows 451 columns - too large Integer solution of 188187 found after 5909 iterations and 145 nodes (6.53 seconds) Full problem 224 rows 500 columns, reduced to 182 rows 453 columns - too large Integer solution of 188182 found by rounding after 5941 iterations and 155 nodes (6.56 seconds) Full problem 224 rows 500 columns, reduced to 184 rows 455 columns - too large Search completed - best objective 188182, took 6106 iterations and 254 nodes (6.68 seconds) Strong branching done 924 times (30616 iterations), fathomed 5 nodes and fixed 21 variables Maximum depth 21, 96 variables fixed on reduced cost Cuts at root node changed objective from 184034 to 187098 Probing was tried 195 times and created 161 cuts of which 49 were active after adding rounds of cuts (1.632 seconds) Gomory was tried 95 times and created 1704 cuts of which 119 were active after adding rounds of cuts (0.208 seconds) Knapsack was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) Clique was tried 39 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 39 times and created 55 cuts of which 4 were active after adding rounds of cuts (0.004 seconds) FlowCover was tried 39 times and created 9 cuts of which 4 were active after adding rounds of cuts (0.336 seconds) TwoMirCuts was tried 39 times and created 262 cuts of which 21 were active after adding rounds of cuts (0.044 seconds) Result - Finished objective 188182 after 254 nodes and 6106 iterations - took 6.70 seconds (total time 6.71) Total time 6.71 Solved to optimality. Writing solution. Objective: 188182 Time: 6.71 s --- Restarting execution --- dcmulti.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job dcmulti.gms Stop 08/21/08 07:01:43 elapsed 0:00:06.842