--- Job bienst1 Start 08/21/08 19:04:17 GAMS Rev 228 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.008 --- 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.020 GAMS/CoinCbc 2.1 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.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 11.7241 - 0.01 seconds processed model has 520 rows, 449 columns (28 integer) and 2072 elements Pass 1: suminf. 4.00000 obj. 11.7241 iterations 1 Pass 2: suminf. 4.00000 obj. 11.7241 iterations 0 Pass 3: suminf. 2.58079 obj. 32.9162 iterations 305 Pass 4: suminf. 1.95222 obj. 44.0051 iterations 95 Pass 5: suminf. 1.00000 obj. 58.5589 iterations 118 Pass 6: suminf. 1.00000 obj. 58.5589 iterations 1 Pass 7: suminf. 1.69687 obj. 45.556 iterations 117 Pass 8: suminf. 0.00000 obj. 77.1838 iterations 113 Solution found of 77.1838 Before mini branch and bound, 1 integers at bound fixed and 184 continuous Full problem 520 rows 449 columns, reduced to 331 rows 263 columns - too large Mini branch and bound did not improve solution (0.09 seconds) After 0.09 seconds - Feasibility pump exiting with objective of 4.44089e-16 - took 0.09 seconds Integer solution of 63 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) Full problem 520 rows 449 columns, reduced to 275 rows 257 columns 39 added rows had average density of 10.3077 At root node, 39 cuts changed objective from 11.7241 to 34.252 in 12 passes Cut generator 0 (Probing) - 107 row cuts (16 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 1 (Gomory) - 3 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.016 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) - 117 row cuts (14 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 20 row cuts (1 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 129 row cuts (8 active), 0 column cuts in 0.016 seconds - new frequency is -100 After 0 nodes, 1 on tree, 63 best solution, best possible 34.252 (0.69 seconds) Integer solution of 55.6 found after 12352 iterations and 136 nodes (2.79 seconds) Full problem 520 rows 449 columns, reduced to 351 rows 299 columns - too large Integer solution of 53.4 found after 13253 iterations and 153 nodes (2.92 seconds) Full problem 520 rows 449 columns, reduced to 363 rows 324 columns - too large Integer solution of 51 found after 20474 iterations and 264 nodes (3.65 seconds) Full problem 520 rows 449 columns, reduced to 442 rows 383 columns - too large Integer solution of 48.6 found after 54798 iterations and 708 nodes (6.85 seconds) Integer solution of 46.75 found after 54819 iterations and 709 nodes (6.86 seconds) Full problem 520 rows 449 columns, reduced to 473 rows 408 columns - too large After 1000 nodes, 171 on tree, 46.75 best solution, best possible 36.9163 (9.07 seconds) After 2000 nodes, 229 on tree, 46.75 best solution, best possible 36.9163 (15.64 seconds) After 3000 nodes, 308 on tree, 46.75 best solution, best possible 36.9163 (22.08 seconds) After 4000 nodes, 274 on tree, 46.75 best solution, best possible 40.3883 (27.87 seconds) After 5000 nodes, 201 on tree, 46.75 best solution, best possible 40.3883 (33.18 seconds) After 6000 nodes, 51 on tree, 46.75 best solution, best possible 43.5831 (38.25 seconds) Search completed - best objective 46.75, took 285634 iterations and 6256 nodes (39.50 seconds) Strong branching done 518 times (14916 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 22, 307 variables fixed on reduced cost Cuts at root node changed objective from 11.7241 to 34.252 Probing was tried 3604 times and created 14219 cuts of which 6294 were active after adding rounds of cuts (1.412 seconds) Gomory was tried 12 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) Knapsack was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) Clique was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3604 times and created 10467 cuts of which 7250 were active after adding rounds of cuts (1.116 seconds) FlowCover was tried 12 times and created 20 cuts of which 1 were active after adding rounds of cuts (0.008 seconds) TwoMirCuts was tried 12 times and created 129 cuts of which 8 were active after adding rounds of cuts (0.016 seconds) Result - Finished objective 46.75 after 6256 nodes and 285634 iterations - took 39.51 seconds (total time 39.52) Total time 39.57 Solved to optimality. MIP solution: 46.75 (6256 nodes, 39.57 seconds) Best possible: 46.75 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- bienst1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bienst1.gms Stop 08/21/08 19:04:57 elapsed 0:00:40.294