--- Job lseu Start 07/17/08 19:33:22 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 --- lseu.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/lseu.gdx --- lseu.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.017 --- lseu.gms(123) 4 Mb --- Generating MIP model m --- lseu.gms(124) 4 Mb --- 29 rows 90 columns 395 non-zeroes --- 89 discrete-columns --- Executing Cbc: elapsed 0:00:00.020 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: 89 columns and 28 rows. 89 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 834.682 - -0.00 seconds 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions processed model has 28 rows, 88 columns (88 integer) and 308 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 0.69474 obj. 1030.18 iterations 12 Pass 2: suminf. 1.32732 obj. 1397.75 iterations 4 Pass 3: suminf. 0.45714 obj. 1400.8 iterations 2 Pass 4: suminf. 0.35238 obj. 1399.47 iterations 1 Pass 5: suminf. 0.56184 obj. 3552.5 iterations 22 Pass 6: suminf. 0.13684 obj. 3699.55 iterations 4 Pass 7: suminf. 0.36000 obj. 3543.48 iterations 2 Pass 8: suminf. 0.21905 obj. 3544.47 iterations 1 Pass 9: suminf. 1.12452 obj. 3300.06 iterations 16 Pass 10: suminf. 0.43097 obj. 3132.93 iterations 5 Pass 11: suminf. 0.57399 obj. 3153.53 iterations 2 Pass 12: suminf. 0.46135 obj. 3135.06 iterations 1 Pass 13: suminf. 0.52897 obj. 3920.31 iterations 17 Pass 14: suminf. 0.06897 obj. 3920.31 iterations 5 Pass 15: suminf. 0.71373 obj. 3950.5 iterations 3 Pass 16: suminf. 0.20230 obj. 3747.38 iterations 3 Pass 17: suminf. 0.06897 obj. 3748.31 iterations 1 Pass 18: suminf. 0.28571 obj. 3896 iterations 2 Pass 19: suminf. 0.23048 obj. 3895.61 iterations 1 Pass 20: suminf. 0.53793 obj. 4478.4 iterations 20 No solution found this major pass Before mini branch and bound, 41 integers at bound fixed and 0 continuous Full problem 28 rows 88 columns, reduced to 21 rows 47 columns Mini branch and bound improved solution from 1.79769e+308 to 1289 (0.06 seconds) Round again with cutoff of 1254.58 Reduced cost fixing fixed 3 variables on major pass 2 Pass 20: suminf. 0.69474 obj. 1030.18 iterations 14 Pass 21: suminf. 0.64618 obj. 1254.58 iterations 5 Pass 22: suminf. 0.32958 obj. 1254.58 iterations 1 Pass 23: suminf. 1.58220 obj. 1094.27 iterations 5 Pass 24: suminf. 0.66501 obj. 1050.42 iterations 4 Pass 25: suminf. 0.72041 obj. 1254.58 iterations 5 Pass 26: suminf. 0.56831 obj. 1254.58 iterations 4 Pass 27: suminf. 0.77224 obj. 1056.57 iterations 3 Pass 28: suminf. 0.69474 obj. 1031.39 iterations 2 Pass 29: suminf. 0.64970 obj. 1254.58 iterations 4 Pass 30: suminf. 0.32958 obj. 1254.58 iterations 2 Pass 31: suminf. 1.58220 obj. 1094.27 iterations 5 Pass 32: suminf. 0.66501 obj. 1050.42 iterations 4 Pass 33: suminf. 0.72041 obj. 1254.58 iterations 5 Pass 34: suminf. 0.56831 obj. 1254.58 iterations 4 Pass 35: suminf. 0.77224 obj. 1056.57 iterations 3 Pass 36: suminf. 0.69474 obj. 1031.39 iterations 2 Pass 37: suminf. 0.64970 obj. 1254.58 iterations 4 Pass 38: suminf. 0.32958 obj. 1254.58 iterations 2 Pass 39: suminf. 1.58220 obj. 1094.27 iterations 5 No solution found this major pass Before mini branch and bound, 74 integers at bound fixed and 0 continuous Full problem 28 rows 88 columns, reduced to 10 rows 14 columns Mini branch and bound did not improve solution (0.06 seconds) After 0.06 seconds - Feasibility pump exiting with objective of 1289 - took 0.06 seconds Integer solution of 1289 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Full problem 28 rows 88 columns, reduced to 7 rows 13 columns Integer solution of 1174 found by combine solutions after 0 iterations and 0 nodes (0.07 seconds) 11 added rows had average density of 40.2727 At root node, 11 cuts changed objective from 944.754 to 1047.48 in 85 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.612 seconds - new frequency is 10 Cut generator 1 (Gomory) - 310 row cuts (3 active), 0 column cuts in 0.032 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 129 row cuts (4 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 155 row cuts (2 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 265 row cuts (2 active), 0 column cuts in 0.020 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1174 best solution, best possible 1047.48 (0.83 seconds) Cbc0038I Full problem 28 rows 88 columns, reduced to 13 rows 18 columns Cbc0038I Full problem 28 rows 88 columns, reduced to 7 rows 11 columns Cbc0038I Full problem 28 rows 88 columns, reduced to 17 rows 24 columns Cbc0038I Full problem 28 rows 88 columns, reduced to 7 rows 11 columns Cbc0038I Full problem 28 rows 88 columns, reduced to 11 rows 16 columns Cbc0038I Full problem 28 rows 88 columns, reduced to 17 rows 24 columns Solved to optimality. wallclocktime: 1.55919 used seconds: 2.09 MIP solution: 1120 (154 nodes, 2.09 seconds) Best possible: 1120 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- lseu.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job lseu.gms Stop 07/17/08 19:33:24 elapsed 0:00:01.601