--- Job ran6x43 Start 08/22/08 02:54:23 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 --- 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.007 --- 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.016 GAMS/CoinCbc 2.1 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.10.00, build Jun 21 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: suminf. 0.12511 obj. 6270.98 iterations 96 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 8 rows 10 columns Mini branch and bound improved solution from 6683 to 6565 (0.01 seconds) Round again with cutoff of 6532.97 Pass 2: suminf. 0.12511 obj. 6270.98 iterations 72 Pass 3: suminf. 0.23454 obj. 6532.97 iterations 57 Pass 4: suminf. 0.04082 obj. 6495 iterations 23 Pass 5: suminf. 1.30263 obj. 6532.97 iterations 93 Pass 6: suminf. 0.67187 obj. 6532.97 iterations 44 Pass 7: suminf. 0.39230 obj. 6532.97 iterations 20 Pass 8: suminf. 0.33400 obj. 6532.97 iterations 27 Pass 9: suminf. 0.35637 obj. 6532.97 iterations 51 Pass 10: suminf. 1.60233 obj. 6532.97 iterations 79 Pass 11: suminf. 0.52427 obj. 6532.97 iterations 105 Pass 12: suminf. 0.51703 obj. 6532.97 iterations 91 Pass 13: suminf. 0.51703 obj. 6532.97 iterations 33 Pass 14: suminf. 1.26580 obj. 6532.97 iterations 59 Pass 15: suminf. 1.34426 obj. 6532.97 iterations 122 Pass 16: suminf. 0.73636 obj. 6532.97 iterations 38 Pass 17: suminf. 1.25378 obj. 6532.97 iterations 94 Pass 18: suminf. 0.86108 obj. 6532.97 iterations 48 Pass 19: suminf. 1.28414 obj. 6532.97 iterations 108 Pass 20: suminf. 2.91989 obj. 6532.97 iterations 56 Pass 21: suminf. 1.66503 obj. 6532.97 iterations 35 Before mini branch and bound, 205 integers at bound fixed and 206 continuous Full problem 307 rows 516 columns, reduced to 66 rows 91 columns Mini branch and bound improved solution from 6565 to 6532 (0.16 seconds) After 0.16 seconds - Feasibility pump exiting with objective of 6532 - took 0.16 seconds Integer solution of 6532 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Full problem 307 rows 516 columns, reduced to 0 rows 0 columns 22 added rows had average density of 76.7273 At root node, 22 cuts changed objective from 6244.71 to 6288.23 in 11 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.072 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 29 row cuts (5 active), 0 column cuts in 0.012 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) - 32 row cuts (12 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 23 row cuts (2 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 19 row cuts (3 active), 0 column cuts in 0.016 seconds - new frequency is -100 After 0 nodes, 1 on tree, 6532 best solution, best possible 6288.23 (0.51 seconds) Strong branching is fixing too many variables, too expensively! Full problem 307 rows 516 columns, reduced to 23 rows 29 columns Full problem 307 rows 516 columns, reduced to 32 rows 42 columns Full problem 307 rows 516 columns, reduced to 38 rows 51 columns Integer solution of 6330 found after 4407 iterations and 209 nodes (3.08 seconds) Full problem 307 rows 516 columns, reduced to 42 rows 57 columns Search completed - best objective 6330, took 4806 iterations and 260 nodes (3.25 seconds) Strong branching done 1448 times (19234 iterations), fathomed 8 nodes and fixed 109 variables Maximum depth 29, 4825 variables fixed on reduced cost Cuts at root node changed objective from 6244.71 to 6288.23 Probing was tried 30 times and created 8 cuts of which 5 were active after adding rounds of cuts (0.076 seconds) Gomory was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Knapsack was tried 95 times and created 90 cuts of which 13 were active after adding rounds of cuts (0.076 seconds) Clique was tried 11 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 95 times and created 97 cuts of which 53 were active after adding rounds of cuts (0.028 seconds) FlowCover was tried 95 times and created 173 cuts of which 86 were active after adding rounds of cuts (0.068 seconds) TwoMirCuts was tried 10 times and created 19 cuts of which 3 were active after adding rounds of cuts (0.016 seconds) Result - Finished objective 6330 after 260 nodes and 4806 iterations - took 3.26 seconds (total time 3.27) Total time 3.28 Solved to optimality. MIP solution: 6330 (260 nodes, 3.28 seconds) Best possible: 6330 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran6x43.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran6x43.gms Stop 08/22/08 02:54:27 elapsed 0:00:03.330