--- Job neos6 Start 08/21/08 10:54: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 --- neos6.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/neos6.gdx --- neos6.gms(148) 10 Mb --- Starting execution: elapsed 0:00:00.209 --- neos6.gms(123) 10 Mb --- Generating MIP model m --- neos6.gms(124) 19 Mb --- 1,037 rows 8,787 columns 252,170 non-zeroes --- 8,340 discrete-columns --- neos6.gms(124) 18 Mb --- Executing COINCBC: elapsed 0:00:00.687 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 8786 columns and 1036 rows. 8340 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 83 - 0.77 seconds 0 fixed, 446 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 1036 rows, 8786 columns (8340 integer) and 251946 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 12.12500 --> up = 3 , down = 4 Pass 2: obj. 8.00000 --> up = 6 , down = 1 Pass 3: obj. 2.39667 --> up = 0 , down = 0 -- rand = 12 ( 26) Pass 4: obj. 6.00000 --> up = 3 , down = 3 Pass 5: obj. 0.88889 --> up = 0 , down = 0 -- rand = 6 ( 28) Pass 6: obj. 2.44444 --> up = 1 , down = 1 Pass 7: obj. 0.88889 --> up = 0 , down = 0 -- rand = 4 ( 12) Pass 8: obj. 2.22222 --> up = 1 , down = 1 Pass 9: obj. 0.66667 --> up = 0 , down = 0 -- rand = 4 ( 28) perturbation applied Pass 10: obj. 231.00000 --> up = 3 , down = 228 Pass 11: obj. 0.33333 --> up = 0 , down = 0 -- rand = 3 ( 18) Pass 12: obj. 0.44444 --> up = 0 , down = 0 -- rand = 2 ( 29) Pass 13: obj. 0.22222 --> up = 0 , down = 0 -- rand = 2 ( 20) perturbation applied Pass 14: obj. 256.00000 --> up = 0 , down = 257 Pass 15: obj. 0.22222 --> up = 0 , down = 0 -- rand = 2 ( 15) - solution found of 123 Before mini branch and bound, 8175 integers at bound fixed and 288 continuous Full problem 1036 rows 8786 columns, reduced to 393 rows 318 columns Mini branch and bound did not improve solution (7.06 seconds) Round again with cutoff of 119 Pass 16: obj. 12.12500 --> up = 3 , down = 4 Pass 17: obj. 8.00000 --> up = 6 , down = 1 Pass 18: obj. 2.39667 --> up = 0 , down = 0 -- rand = 12 ( 20) Pass 19: obj. 5.82456 --> up = 3 , down = 3 Pass 20: obj. 1.75694 --> up = 0 , down = 0 -- rand = 11 ( 16) Pass 21: obj. 3.41389 --> up = 2 , down = 1 Pass 22: obj. 1.38272 --> up = 0 , down = 0 -- rand = 5 ( 11) Pass 23: obj. 1.66667 --> up = 1 , down = 0 Pass 24: obj. 0.90278 --> up = 0 , down = 0 -- rand = 4 ( 21) Pass 25: obj. 2.63889 --> up = 2 , down = 0 Pass 26: obj. 1.00000 --> up = 0 , down = 0 -- rand = 3 ( 29) perturbation applied Pass 27: obj. 220.00000 --> up = 0 , down = 220 Pass 28: obj. 0.55556 --> up = 0 , down = 0 -- rand = 8 ( 23) Pass 29: obj. 2.25309 --> up = 0 , down = 1 Pass 30: obj. 1.25309 --> up = 0 , down = 0 -- rand = 5 ( 20) Pass 31: obj. 1.80159 --> up = 0 , down = 1 Pass 32: obj. 0.80159 --> up = 0 , down = 0 -- rand = 5 ( 11) Pass 33: obj. 2.25309 --> up = 0 , down = 1 perturbation applied Pass 34: obj. 205.00000 --> up = 1 , down = 204 Pass 35: obj. 0.55556 --> No solution found this major pass Before mini branch and bound, 8175 integers at bound fixed and 289 continuous Full problem 1036 rows 8786 columns, reduced to 383 rows 318 columns Mini branch and bound did not improve solution (14.90 seconds) After 14.90 seconds - Feasibility pump exiting - took 14.85 seconds Integer solution of 123 found by feasibility pump after 0 iterations and 0 nodes (14.97 seconds) Full problem 1036 rows 8786 columns, reduced to 223 rows 446 columns 4 added rows had average density of 3 At root node, 4 cuts changed objective from 83 to 83 in 3 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 1 column cuts in 0.316 seconds - new frequency is 2 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.024 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) - 114 row cuts (3 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.152 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.028 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.116 seconds - new frequency is -100 After 0 nodes, 1 on tree, 123 best solution, best possible 83 (16.93 seconds) After 100 nodes, 53 on tree, 123 best solution, best possible 83 (115.22 seconds) After 200 nodes, 105 on tree, 123 best solution, best possible 83 (206.83 seconds) Full problem 1036 rows 8786 columns, reduced to 348 rows 523 columns Integer solution of 89 found by combine solutions after 25892 iterations and 217 nodes (213.79 seconds) After 300 nodes, 151 on tree, 89 best solution, best possible 83 (284.49 seconds) After 400 nodes, 201 on tree, 89 best solution, best possible 83 (348.44 seconds) Integer solution of 84 found after 56931 iterations and 477 nodes (386.34 seconds) Full problem 1036 rows 8786 columns, reduced to 382 rows 544 columns After 500 nodes, 151 on tree, 84 best solution, best possible 83 (390.51 seconds) After 600 nodes, 182 on tree, 84 best solution, best possible 83 (400.59 seconds) After 700 nodes, 199 on tree, 84 best solution, best possible 83 (405.81 seconds) After 800 nodes, 222 on tree, 84 best solution, best possible 83 (410.50 seconds) After 900 nodes, 229 on tree, 84 best solution, best possible 83 (414.22 seconds) After 1000 nodes, 244 on tree, 84 best solution, best possible 83 (418.01 seconds) After 1100 nodes, 245 on tree, 84 best solution, best possible 83 (420.65 seconds) After 1200 nodes, 271 on tree, 84 best solution, best possible 83 (424.64 seconds) After 1300 nodes, 298 on tree, 84 best solution, best possible 83 (427.75 seconds) Integer solution of 83 found after 113728 iterations and 1341 nodes (428.71 seconds) Search completed - best objective 83, took 113728 iterations and 1341 nodes (428.75 seconds) Strong branching done 6330 times (527583 iterations), fathomed 14 nodes and fixed 43 variables Maximum depth 76, 65714 variables fixed on reduced cost Cuts at root node changed objective from 83 to 83 Probing was tried 540 times and created 18 cuts of which 18 were active after adding rounds of cuts (12.945 seconds) Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Clique was tried 324 times and created 5386 cuts of which 282 were active after adding rounds of cuts (0.768 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.152 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.116 seconds) Result - Finished objective 83 after 1341 nodes and 113728 iterations - took 440.47 seconds (total time 441.27) Total time 441.42 Solved to optimality. Writing solution. Objective: 83 Time: 441.45 s --- Restarting execution --- neos6.gms(124) 0 Mb --- Reading solution for model m --- neos6.gms(124) 10 Mb *** Status: Normal completion --- Job neos6.gms Stop 08/21/08 11:02:19 elapsed 0:07:32.062