--- Job ran4x64 Start 07/18/08 16:00:48 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 --- 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.007 --- 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 Cbc: elapsed 0:00:00.017 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" 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 Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is 9637.93 - 0.02 seconds processed model has 324 rows, 512 columns (256 integer) and 1024 elements Pass 1: suminf. 0.25423 obj. 9741.12 iterations 93 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 89 Pass 3: suminf. 0.26624 obj. 9974.59 iterations 36 Pass 4: suminf. 0.25769 obj. 9974.59 iterations 27 Pass 5: suminf. 0.61507 obj. 9974.59 iterations 53 Pass 6: suminf. 0.18605 obj. 9970 iterations 54 Pass 7: suminf. 0.61507 obj. 9974.59 iterations 30 Pass 8: suminf. 1.29744 obj. 9974.59 iterations 85 Pass 9: suminf. 1.06470 obj. 9974.59 iterations 26 Pass 10: suminf. 1.37304 obj. 9974.59 iterations 94 Pass 11: suminf. 0.37491 obj. 9949.11 iterations 54 Pass 12: suminf. 0.91357 obj. 9974.59 iterations 43 Pass 13: suminf. 0.54796 obj. 9974.59 iterations 20 Pass 14: suminf. 1.18058 obj. 9974.59 iterations 83 Pass 15: suminf. 0.71069 obj. 9974.59 iterations 33 Pass 16: suminf. 0.80875 obj. 9974.59 iterations 25 Pass 17: suminf. 0.80875 obj. 9974.59 iterations 20 Pass 18: suminf. 0.71069 obj. 9974.59 iterations 42 Pass 19: suminf. 1.32511 obj. 9974.59 iterations 59 Pass 20: suminf. 1.13969 obj. 9974.59 iterations 56 Pass 21: suminf. 1.16165 obj. 9974.59 iterations 113 Before mini branch and bound, 212 integers at bound fixed and 211 continuous Full problem 324 rows 512 columns, reduced to 53 rows 75 columns Mini branch and bound improved solution from 10012 to 9828 (0.16 seconds) After 0.16 seconds - Feasibility pump exiting with objective of 9828 - took 0.16 seconds Integer solution of 9828 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Full problem 324 rows 512 columns, reduced to 0 rows 0 columns 13 added rows had average density of 136.615 At root node, 13 cuts changed objective from 9637.93 to 9683.47 in 9 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 1 column cuts in 0.100 seconds - new frequency is 1 Cut generator 1 (Gomory) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.008 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) - 24 row cuts (7 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 17 row cuts (2 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 57 row cuts (4 active), 0 column cuts in 0.024 seconds - new frequency is -100 After 0 nodes, 1 on tree, 9828 best solution, best possible 9683.47 (0.45 seconds) Cbc0038I Full problem 324 rows 512 columns, reduced to 30 rows 39 columns Cbc0038I Full problem 324 rows 512 columns, reduced to 0 rows 0 columns Cbc0038I Full problem 324 rows 512 columns, reduced to 30 rows 39 columns Cbc0038I Full problem 324 rows 512 columns, reduced to 14 rows 16 columns Cbc0038I Full problem 324 rows 512 columns, reduced to 36 rows 48 columns Cbc0038I Full problem 324 rows 512 columns, reduced to 30 rows 39 columns Solved to optimality. wallclocktime: 1.44742 used seconds: 2.22 MIP solution: 9711 (125 nodes, 2.22 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 07/18/08 16:00:49 elapsed 0:00:01.490