--- Job mitre Start 08/21/08 08:30:52 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 --- mitre.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mitre.gdx --- mitre.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.107 --- mitre.gms(123) 5 Mb --- Generating MIP model m --- mitre.gms(124) 8 Mb --- 2,055 rows 9,959 columns 46,330 non-zeroes --- 9,958 discrete-columns --- mitre.gms(124) 7 Mb --- Executing COINCBC: elapsed 0:00:00.257 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 9958 columns and 2054 rows. 9958 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 114828 - 0.17 seconds 4514 fixed, 0 tightened bounds, 0 strengthened rows, 22 substitutions 4514 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 21 fixed, 0 tightened bounds, 30 strengthened rows, 38 substitutions 7 fixed, 0 tightened bounds, 29 strengthened rows, 50 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 26 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 29 strengthened rows, 0 substitutions processed model has 1236 rows, 5403 columns (5403 integer) and 19383 elements Objective coefficients multiple of 15 Cutoff increment increased from 1e-05 to 14.985 Objective coefficients multiple of 15 Pass 1: obj. 1.64444 --> up = 0 , down = 0 -- rand = 8 ( 16) Pass 2: obj. 2.07639 --> up = 1 , down = 1 Pass 3: obj. 0.29861 --> up = 0 , down = 0 -- rand = 4 ( 27) Pass 4: obj. 2.63889 --> up = 1 , down = 1 Pass 5: obj. 0.86111 --> up = 0 , down = 0 -- rand = 4 ( 24) perturbation applied Pass 6: obj. 205.95736 --> up = 9 , down = 196 Pass 7: obj. 2.84602 --> up = 0 , down = 0 -- rand = 16 ( 23) Pass 8: obj. 3.82219 --> up = 2 , down = 2 Pass 9: obj. 1.18727 --> up = 0 , down = 0 -- rand = 10 ( 18) Pass 10: obj. 4.50233 --> up = 2 , down = 2 Pass 11: obj. 1.86741 --> up = 0 , down = 0 -- rand = 10 ( 29) perturbation applied Pass 12: obj. 213.38901 --> up = 9 , down = 202 Pass 13: obj. 3.86842 --> up = 0 , down = 0 -- rand = 12 ( 12) Pass 14: obj. 2.52160 --> up = 1 , down = 1 Pass 15: obj. 1.66446 --> up = 0 , down = 0 -- rand = 14 ( 14) Pass 16: obj. 8.02514 --> up = 4 , down = 4 Pass 17: obj. 2.34461 --> up = 0 , down = 0 -- rand = 14 ( 25) Pass 18: obj. 7.34499 --> up = 4 , down = 4 perturbation applied Pass 19: obj. 362.90871 --> up = 19 , down = 339 Pass 20: obj. 11.99647 --> No solution found this major pass Before mini branch and bound, 5228 integers at bound fixed and 0 continuous Mini branch and bound did not improve solution (0.22 seconds) Full problem 1237 rows 5403 columns, reduced to 1237 rows 5403 columns - too large After 0.32 seconds - Feasibility pump exiting - took 0.31 seconds 17 added rows had average density of 40.1765 At root node, 17 cuts changed objective from 115135 to 115155 in 3 passes Cut generator 0 (Probing) - 5 row cuts (2 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 1 (Gomory) - 36 row cuts (2 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 19 row cuts (4 active), 0 column cuts in 0.032 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) - 8 row cuts (2 active), 0 column cuts in 0.008 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) - 56 row cuts (7 active), 0 column cuts in 0.020 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 115155 (0.50 seconds) Integer solution of 115155 found after 102 iterations and 2 nodes (0.62 seconds) Search completed - best objective 115155, took 102 iterations and 2 nodes (0.62 seconds) Strong branching done 28 times (183 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 1, 0 variables fixed on reduced cost Cuts at root node changed objective from 115135 to 115155 Probing was tried 5 times and created 5 cuts of which 3 were active after adding rounds of cuts (0.016 seconds) Gomory was tried 3 times and created 36 cuts of which 2 were active after adding rounds of cuts (0.008 seconds) Knapsack was tried 5 times and created 21 cuts of which 5 were active after adding rounds of cuts (0.052 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 8 cuts of which 2 were active after adding rounds of cuts (0.008 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 3 times and created 56 cuts of which 7 were active after adding rounds of cuts (0.020 seconds) Result - Finished objective 115155 after 2 nodes and 102 iterations - took 9.86 seconds (total time 10.05) Total time 10.14 Solved to optimality. Writing solution. Objective: 115155 Time: 10.16 s --- Restarting execution --- mitre.gms(124) 0 Mb --- Reading solution for model m --- mitre.gms(124) 5 Mb *** Status: Normal completion --- Job mitre.gms Stop 08/21/08 08:31:03 elapsed 0:00:10.537