--- Job ran6x43 Start 08/21/08 12:42:25 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 --- ran6x43.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran6x43.gdx --- ran6x43.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.011 --- ran6x43.gms(123) 4 Mb --- Generating MIP model m --- ran6x43.gms(124) 4 Mb --- 308 rows 517 columns 1,549 non-zeroes --- 258 discrete-columns --- Executing COINCBC: elapsed 0:00:00.020 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 516 columns and 307 rows. 258 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 6244.71 - 0.01 seconds processed model has 307 rows, 516 columns (258 integer) and 1032 elements Pass 1: obj. 0.12511 --> up = 0 , down = 0 -- rand = 3 ( 27) - solution found of 6683 Before mini branch and bound, 250 integers at bound fixed and 249 continuous Full problem 307 rows 516 columns, reduced to 4 rows 6 columns Mini branch and bound improved solution from 6683 to 6565 (0.01 seconds) Round again with cutoff of 6532.97 Pass 2: obj. 0.12511 --> up = 0 , down = 0 -- rand = 3 ( 29) Pass 3: obj. 0.76546 --> up = 0 , down = 1 Pass 4: obj. 0.04082 --> up = 0 , down = 0 -- rand = 1 ( 15) perturbation applied Pass 5: obj. 45.18422 --> up = 5 , down = 40 Pass 6: obj. 0.53601 --> up = 0 , down = 0 -- rand = 5 ( 29) Pass 7: obj. 4.40521 --> up = 1 , down = 4 perturbation applied Pass 8: obj. 43.33361 --> up = 10 , down = 33 Pass 9: obj. 1.14827 --> up = 0 , down = 0 -- rand = 5 ( 29) Pass 10: obj. 3.53051 --> up = 2 , down = 3 perturbation applied Pass 11: obj. 51.08083 --> up = 4 , down = 48 Pass 12: obj. 1.13786 --> up = 0 , down = 0 -- rand = 7 ( 27) Pass 13: obj. 2.98893 --> up = 1 , down = 1 Pass 14: obj. 0.98893 --> up = 0 , down = 0 -- rand = 4 ( 22) Pass 15: obj. 2.54105 --> up = 2 , down = 1 Pass 16: obj. 0.80185 --> up = 0 , down = 0 -- rand = 4 ( 24) Pass 17: obj. 2.75939 --> up = 2 , down = 1 perturbation applied Pass 18: obj. 49.71043 --> up = 5 , down = 46 Pass 19: obj. 0.71352 --> up = 0 , down = 0 -- rand = 4 ( 10) Pass 20: obj. 2.67843 --> up = 0 , down = 3 Pass 21: obj. 1.10802 --> No solution found this major pass Before mini branch and bound, 212 integers at bound fixed and 215 continuous Full problem 307 rows 516 columns, reduced to 49 rows 68 columns Mini branch and bound improved solution from 6565 to 6454 (0.17 seconds) After 0.17 seconds - Feasibility pump exiting - took 0.17 seconds Integer solution of 6454 found by feasibility pump after 0 iterations and 0 nodes (0.17 seconds) Full problem 307 rows 516 columns, reduced to 0 rows 0 columns 18 added rows had average density of 238.778 At root node, 18 cuts changed objective from 6244.71 to 6295.26 in 24 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.328 seconds - new frequency is 10 Cut generator 1 (Gomory) - 288 row cuts (8 active), 0 column cuts in 0.036 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 47 row cuts (3 active), 0 column cuts in 0.020 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) - 65 row cuts (5 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 31 row cuts (2 active), 0 column cuts in 0.028 seconds - new frequency is -100 After 0 nodes, 1 on tree, 6454 best solution, best possible 6295.26 (0.88 seconds) Strong branching is fixing too many variables, too expensively! Full problem 307 rows 516 columns, reduced to 7 rows 8 columns Full problem 307 rows 516 columns, reduced to 13 rows 16 columns Full problem 307 rows 516 columns, reduced to 16 rows 21 columns Search completed - best objective 6330, took 4289 iterations and 356 nodes (3.68 seconds) Strong branching done 1730 times (18528 iterations), fathomed 25 nodes and fixed 272 variables Maximum depth 25, 4808 variables fixed on reduced cost Cuts at root node changed objective from 6244.71 to 6295.26 Probing was tried 50 times and created 8 cuts of which 7 were active after adding rounds of cuts (0.332 seconds) Gomory was tried 93 times and created 290 cuts of which 8 were active after adding rounds of cuts (0.056 seconds) Knapsack was tried 24 times and created 47 cuts of which 3 were active after adding rounds of cuts (0.020 seconds) Clique was tried 24 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 107 times and created 103 cuts of which 35 were active after adding rounds of cuts (0.048 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 20 times and created 31 cuts of which 2 were active after adding rounds of cuts (0.028 seconds) Result - Finished objective 6330 after 356 nodes and 4289 iterations - took 3.69 seconds (total time 3.70) Total time 3.70 Solved to optimality. Writing solution. Objective: 6330 Time: 3.71 s --- Restarting execution --- ran6x43.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran6x43.gms Stop 08/21/08 12:42:28 elapsed 0:00:03.769