--- Job bienst1 Start 08/21/08 03:36:04 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 --- bienst1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/bienst1.gdx --- bienst1.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.030 --- bienst1.gms(123) 4 Mb --- Generating MIP model m --- bienst1.gms(124) 4 Mb --- 577 rows 506 columns 2,186 non-zeroes --- 28 discrete-columns --- bienst1.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.043 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 505 columns and 576 rows. 28 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 11.7241 - 0.01 seconds processed model has 576 rows, 505 columns (28 integer) and 2184 elements Pass 1: obj. 4.00000 --> up = 0 , down = 0 -- rand = 19 ( 19) Pass 2: obj. 15.00000 --> up = 0 , down = 19 perturbation applied Pass 3: obj. 4.00000 --> up = 0 , down = 3 Pass 4: obj. 1.00000 --> up = 1 , down = 0 Pass 5: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 27) - solution found of 127 Before mini branch and bound, 0 integers at bound fixed and 179 continuous Full problem 576 rows 505 columns, reduced to 383 rows 315 columns - too large Mini branch and bound did not improve solution (0.13 seconds) Round again with cutoff of 115.472 Pass 6: obj. 4.00000 --> up = 0 , down = 0 -- rand = 19 ( 19) Pass 7: obj. 15.00000 --> up = 0 , down = 19 perturbation applied Pass 8: obj. 4.00000 --> up = 0 , down = 3 Pass 9: obj. 1.00000 --> up = 1 , down = 0 Pass 10: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 23) - solution found of 115.472 Before mini branch and bound, 0 integers at bound fixed and 178 continuous Full problem 576 rows 505 columns, reduced to 384 rows 316 columns - too large Mini branch and bound did not improve solution (0.26 seconds) After 0.26 seconds - Feasibility pump exiting - took 0.26 seconds Integer solution of 75.3333 found by feasibility pump after 0 iterations and 0 nodes (0.27 seconds) Full problem 576 rows 505 columns, reduced to 263 rows 246 columns 43 added rows had average density of 26.1163 At root node, 43 cuts changed objective from 11.7241 to 37.1454 in 10 passes Cut generator 0 (Probing) - 60 row cuts (12 active), 0 column cuts in 0.064 seconds - new frequency is 1 Cut generator 1 (Gomory) - 187 row cuts (15 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.012 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) - 77 row cuts (8 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 76 row cuts (8 active), 0 column cuts in 0.020 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 79 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 After 0 nodes, 1 on tree, 75.3333 best solution, best possible 37.1454 (1.30 seconds) Integer solution of 75 found after 21007 iterations and 131 nodes (7.12 seconds) Full problem 576 rows 505 columns, reduced to 459 rows 388 columns - too large Integer solution of 55 found after 23904 iterations and 141 nodes (7.45 seconds) Full problem 576 rows 505 columns, reduced to 495 rows 424 columns - too large Integer solution of 52 found after 34610 iterations and 217 nodes (8.73 seconds) Full problem 576 rows 505 columns, reduced to 522 rows 451 columns - too large Integer solution of 50 found after 64998 iterations and 453 nodes (12.07 seconds) Full problem 576 rows 505 columns, reduced to 531 rows 460 columns - too large Integer solution of 47.6 found after 78987 iterations and 580 nodes (13.76 seconds) Full problem 576 rows 505 columns, reduced to 558 rows 487 columns - too large After 1000 nodes, 259 on tree, 47.6 best solution, best possible 37.421 (20.20 seconds) After 2000 nodes, 427 on tree, 47.6 best solution, best possible 37.421 (31.74 seconds) Integer solution of 46.75 found after 275101 iterations and 2376 nodes (36.00 seconds) Full problem 576 rows 505 columns, reduced to 558 rows 487 columns - too large After 3000 nodes, 571 on tree, 46.75 best solution, best possible 40.5 (43.82 seconds) After 4000 nodes, 692 on tree, 46.75 best solution, best possible 40.5 (54.45 seconds) After 5000 nodes, 793 on tree, 46.75 best solution, best possible 41.6948 (64.78 seconds) After 6000 nodes, 749 on tree, 46.75 best solution, best possible 43 (72.68 seconds) After 7000 nodes, 718 on tree, 46.75 best solution, best possible 44 (80.19 seconds) After 8000 nodes, 653 on tree, 46.75 best solution, best possible 44.5 (86.94 seconds) After 9000 nodes, 501 on tree, 46.75 best solution, best possible 45.25 (93.73 seconds) After 10000 nodes, 277 on tree, 46.75 best solution, best possible 46 (99.45 seconds) Search completed - best objective 46.75000000000001, took 729184 iterations and 10818 nodes (103.62 seconds) Strong branching done 466 times (30577 iterations), fathomed 0 nodes and fixed 1 variables Maximum depth 23, 325 variables fixed on reduced cost Cuts at root node changed objective from 11.7241 to 37.1454 Probing was tried 6593 times and created 31983 cuts of which 11960 were active after adding rounds of cuts (3.560 seconds) Gomory was tried 1044 times and created 1294 cuts of which 559 were active after adding rounds of cuts (0.588 seconds) Knapsack was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Clique was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 6593 times and created 15441 cuts of which 8363 were active after adding rounds of cuts (2.088 seconds) FlowCover was tried 6593 times and created 2000 cuts of which 746 were active after adding rounds of cuts (0.756 seconds) TwoMirCuts was tried 10 times and created 79 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Result - Finished objective 46.75000000000001 after 10818 nodes and 729184 iterations - took 103.63 seconds (total time 103.64) Total time 103.68 Solved to optimality. Writing solution. Objective: 46.75 Time: 103.68 s --- Restarting execution --- bienst1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bienst1.gms Stop 08/21/08 03:37:49 elapsed 0:01:45.329