--- Job vpm1 Start 07/18/08 19:09:42 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 --- vpm1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/vpm1.gdx --- vpm1.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- vpm1.gms(123) 4 Mb --- Generating MIP model m --- vpm1.gms(124) 4 Mb --- 235 rows 379 columns 918 non-zeroes --- 168 discrete-columns --- vpm1.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.014 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: 378 columns and 234 rows. 168 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 15.4167 - 0.00 seconds 0 fixed, 0 tightened bounds, 53 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 53 strengthened rows, 0 substitutions processed model has 168 rows, 257 columns (120 integer) and 514 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 2.76667 obj. 17.2667 iterations 18 Pass 2: suminf. 2.26667 obj. 17.2667 iterations 2 Solution found of 23 Before mini branch and bound, 99 integers at bound fixed and 109 continuous Full problem 168 rows 257 columns, reduced to 25 rows 31 columns Mini branch and bound improved solution from 23 to 21 (0.01 seconds) Round again with cutoff of 20.5433 Pass 3: suminf. 2.76667 obj. 17.2667 iterations 17 Pass 4: suminf. 2.26667 obj. 17.2667 iterations 2 Pass 5: suminf. 0.79000 obj. 20.5433 iterations 16 Pass 6: suminf. 0.62333 obj. 20.5433 iterations 4 Pass 7: suminf. 0.54333 obj. 20.5433 iterations 4 Pass 8: suminf. 0.50000 obj. 20.5 iterations 2 Pass 9: suminf. 2.54333 obj. 20.5433 iterations 24 Pass 10: suminf. 1.41667 obj. 20.4167 iterations 21 Pass 11: suminf. 1.29000 obj. 20.5433 iterations 8 Pass 12: suminf. 1.29000 obj. 20.5433 iterations 3 Pass 13: suminf. 1.54333 obj. 20.5433 iterations 8 Pass 14: suminf. 3.29000 obj. 20.5433 iterations 34 Pass 15: suminf. 2.95667 obj. 20.5433 iterations 18 Pass 16: suminf. 3.12333 obj. 20.5433 iterations 15 Pass 17: suminf. 1.95667 obj. 20.5433 iterations 19 Pass 18: suminf. 2.29000 obj. 20.5433 iterations 10 Pass 19: suminf. 2.16500 obj. 20.5433 iterations 10 Pass 20: suminf. 2.12333 obj. 20.5433 iterations 17 Pass 21: suminf. 1.45667 obj. 20.5433 iterations 15 Pass 22: suminf. 1.79000 obj. 20.5433 iterations 14 Before mini branch and bound, 82 integers at bound fixed and 90 continuous Full problem 168 rows 257 columns, reduced to 56 rows 73 columns Mini branch and bound did not improve solution (0.10 seconds) After 0.10 seconds - Feasibility pump exiting with objective of 8 - took 0.10 seconds Integer solution of 23 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) Full problem 168 rows 257 columns, reduced to 20 rows 29 columns Integer solution of 21 found by combine solutions after 0 iterations and 0 nodes (0.11 seconds) 25 added rows had average density of 10.48 At root node, 25 cuts changed objective from 16.4333 to 20 in 5 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is 10 Cut generator 1 (Gomory) - 10 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 26 row cuts (7 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) - 18 row cuts (4 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 9 row cuts (3 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 52 row cuts (11 active), 0 column cuts in 0.000 seconds - new frequency is -100 Integer solution of 20 found after 54 iterations and 0 nodes (0.13 seconds) Thread 0 used 0 times, waiting to start 0, 0 cpu time, 0 locks, 0 locked, 0 waiting for locks Thread 1 used 0 times, waiting to start 3.30792e-05, 0 cpu time, 0 locks, 0 locked, 0 waiting for locks Main thread 0 waiting for threads, 1 locks, 3.21295e-06 locked, 2.8814e-06 waiting for locks Search completed - best objective 20, took 54 iterations and 0 nodes (0.13 seconds) Maximum depth 0, 21 variables fixed on reduced cost Cuts at root node changed objective from 16.4333 to 20 Probing was tried 15 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 15 times and created 30 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 15 times and created 78 cuts of which 21 were active after adding rounds of cuts (0.036 seconds) Clique was tried 15 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 15 times and created 54 cuts of which 12 were active after adding rounds of cuts (0.012 seconds) FlowCover was tried 15 times and created 27 cuts of which 9 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 15 times and created 156 cuts of which 33 were active after adding rounds of cuts (0.000 seconds) 8 bounds tightened after postprocessing Result - Finished objective 20 after 0 nodes and 54 iterations - took 0.14 seconds (total time 0.14) Total time 0.15 Solved to optimality. wallclocktime: 0.159357 used seconds: 0.15 MIP solution: 20 (0 nodes, 0.15 seconds) Best possible: 20 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- vpm1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job vpm1.gms Stop 07/18/08 19:09:43 elapsed 0:00:00.197