--- Job bienst1 Start 07/17/08 15:22:44 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.016 --- 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 Cbc: elapsed 0:00:00.029 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: 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 Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 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. 3.21667 obj. 32.5 iterations 554 Pass 4: suminf. 0.00000 obj. 72.5451 iterations 221 Solution found of 72.5451 Before mini branch and bound, 1 integers at bound fixed and 231 continuous Full problem 520 rows 449 columns, reduced to 279 rows 208 columns - too large Mini branch and bound did not improve solution (0.11 seconds) After 0.11 seconds - Feasibility pump exiting with objective of 6.66134e-16 - took 0.11 seconds Integer solution of 58.8 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) Full problem 520 rows 449 columns, reduced to 242 rows 225 columns 31 added rows had average density of 6.80645 At root node, 31 cuts changed objective from 11.7241 to 35.5742 in 22 passes Cut generator 0 (Probing) - 103 row cuts (11 active), 0 column cuts in 0.028 seconds - new frequency is 1 Cut generator 1 (Gomory) - 61 row cuts (3 active), 0 column cuts in 0.008 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.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 121 row cuts (6 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 29 row cuts (4 active), 0 column cuts in 0.036 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 120 row cuts (4 active), 0 column cuts in 0.020 seconds - new frequency is -100 After 0 nodes, 1 on tree, 58.8 best solution, best possible 35.5742 (0.71 seconds) Cbc0004I Integer solution of 50 found after 10700 iterations and 131 nodes (3.80 seconds) Cbc0038I Full problem 520 rows 449 columns, reduced to 242 rows 225 columns Cbc0038I Full problem 520 rows 449 columns, reduced to 408 rows 337 columns - too large Cbc0004I Integer solution of 48.2 found after 12493 iterations and 166 nodes (4.07 seconds) Cbc0038I Full problem 520 rows 449 columns, reduced to 400 rows 329 columns - too large Cbc0038I Full problem 520 rows 449 columns, reduced to 408 rows 337 columns - too large Cbc0004I Integer solution of 46.75 found after 16961 iterations and 237 nodes (4.60 seconds) Cbc0038I Full problem 520 rows 449 columns, reduced to 448 rows 377 columns - too large Cbc0038I Full problem 520 rows 449 columns, reduced to 408 rows 337 columns - too large Solved to optimality. wallclocktime: 49.2711 used seconds: 95.48 MIP solution: 46.75 (15204 nodes, 95.48 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 07/17/08 15:23:33 elapsed 0:00:49.326