--- Job ran4x64 Start 08/22/08 02:54:21 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 --- ran4x64.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran4x64.gdx --- ran4x64.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- ran4x64.gms(123) 4 Mb --- Generating MIP model m --- ran4x64.gms(124) 4 Mb --- 325 rows 513 columns 1,537 non-zeroes --- 256 discrete-columns --- ran4x64.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.015 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 512 columns and 324 rows. 256 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 9637.93 - 0.01 seconds processed model has 324 rows, 512 columns (256 integer) and 1024 elements Pass 1: suminf. 0.25423 obj. 9741.12 iterations 83 Solution found of 10221 Before mini branch and bound, 247 integers at bound fixed and 246 continuous Full problem 324 rows 512 columns, reduced to 11 rows 13 columns Mini branch and bound improved solution from 10221 to 10012 (0.02 seconds) Round again with cutoff of 9974.59 Pass 2: suminf. 0.25423 obj. 9741.12 iterations 78 Pass 3: suminf. 0.26624 obj. 9974.59 iterations 35 Pass 4: suminf. 0.25769 obj. 9974.59 iterations 25 Pass 5: suminf. 0.61507 obj. 9974.59 iterations 48 Pass 6: suminf. 0.18605 obj. 9970 iterations 50 Pass 7: suminf. 0.61507 obj. 9974.59 iterations 28 Pass 8: suminf. 1.29744 obj. 9974.59 iterations 73 Pass 9: suminf. 1.06470 obj. 9974.59 iterations 28 Pass 10: suminf. 1.37304 obj. 9974.59 iterations 105 Pass 11: suminf. 0.37491 obj. 9932.36 iterations 47 Pass 12: suminf. 0.74608 obj. 9974.59 iterations 53 Pass 13: suminf. 0.71069 obj. 9974.59 iterations 20 Pass 14: suminf. 0.80875 obj. 9974.59 iterations 34 Pass 15: suminf. 0.80875 obj. 9974.59 iterations 16 Pass 16: suminf. 0.71069 obj. 9974.59 iterations 68 Pass 17: suminf. 2.17793 obj. 9974.59 iterations 53 Pass 18: suminf. 2.15435 obj. 9974.59 iterations 15 Pass 19: suminf. 0.77800 obj. 9974.59 iterations 78 Pass 20: suminf. 0.37259 obj. 9974.59 iterations 57 Pass 21: suminf. 0.82226 obj. 9974.59 iterations 56 Before mini branch and bound, 219 integers at bound fixed and 216 continuous Full problem 324 rows 512 columns, reduced to 45 rows 64 columns Mini branch and bound improved solution from 10012 to 9919 (0.13 seconds) After 0.13 seconds - Feasibility pump exiting with objective of 9919 - took 0.13 seconds Integer solution of 9919 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) Full problem 324 rows 512 columns, reduced to 0 rows 0 columns 22 added rows had average density of 109.818 At root node, 22 cuts changed objective from 9637.93 to 9684.62 in 16 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.172 seconds - new frequency is 10 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.032 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 53 row cuts (18 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 20 row cuts (3 active), 0 column cuts in 0.020 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 17 row cuts (1 active), 0 column cuts in 0.032 seconds - new frequency is -100 After 0 nodes, 1 on tree, 9919 best solution, best possible 9684.62 (0.57 seconds) Full problem 324 rows 512 columns, reduced to 18 rows 21 columns Full problem 324 rows 512 columns, reduced to 33 rows 44 columns Full problem 324 rows 512 columns, reduced to 39 rows 53 columns Integer solution of 9711 found by combine solutions after 1508 iterations and 88 nodes (2.10 seconds) Search completed - best objective 9711, took 1937 iterations and 138 nodes (2.27 seconds) Strong branching done 1066 times (11178 iterations), fathomed 3 nodes and fixed 64 variables Maximum depth 20, 2162 variables fixed on reduced cost Cuts at root node changed objective from 9637.93 to 9684.62 Probing was tried 26 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.172 seconds) Gomory was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) Knapsack was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Clique was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 16 times and created 53 cuts of which 18 were active after adding rounds of cuts (0.012 seconds) FlowCover was tried 68 times and created 104 cuts of which 58 were active after adding rounds of cuts (0.084 seconds) TwoMirCuts was tried 16 times and created 17 cuts of which 1 were active after adding rounds of cuts (0.032 seconds) Result - Finished objective 9711 after 138 nodes and 1937 iterations - took 2.28 seconds (total time 2.29) Total time 2.29 Solved to optimality. MIP solution: 9711 (138 nodes, 2.29 seconds) Best possible: 9711 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran4x64.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran4x64.gms Stop 08/22/08 02:54:23 elapsed 0:00:02.362