--- Job vpm1 Start 08/22/08 05:16:52 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 --- 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.005 --- 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 COINCBC: elapsed 0:00:00.012 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest 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 Jun 21 2008 command line - GAMS/CBC -solve -quit 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, 264 columns (120 integer) and 521 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 3.26667 obj. 17.2667 iterations 17 Solution found of 23 Before mini branch and bound, 101 integers at bound fixed and 121 continuous Full problem 168 rows 264 columns, reduced to 15 rows 19 columns Mini branch and bound improved solution from 23 to 21 (0.01 seconds) Round again with cutoff of 20.5433 Pass 2: suminf. 3.26667 obj. 17.2667 iterations 17 Pass 3: suminf. 1.54333 obj. 20.5433 iterations 10 Pass 4: suminf. 0.75000 obj. 19.75 iterations 4 Pass 5: suminf. 0.45667 obj. 20.5433 iterations 2 Pass 6: suminf. 0.25000 obj. 20.25 iterations 1 Pass 7: suminf. 1.04333 obj. 20.5433 iterations 8 Pass 8: suminf. 0.41667 obj. 20.4167 iterations 4 Pass 9: suminf. 0.54333 obj. 20.5433 iterations 1 Pass 10: suminf. 1.79000 obj. 20.5433 iterations 18 Pass 11: suminf. 1.29000 obj. 20.5433 iterations 1 Pass 12: suminf. 1.29000 obj. 20.5433 iterations 1 Pass 13: suminf. 1.32333 obj. 20.5433 iterations 12 Pass 14: suminf. 1.32333 obj. 20.5433 iterations 7 Pass 15: suminf. 1.65667 obj. 20.5433 iterations 2 Pass 16: suminf. 1.95667 obj. 20.5433 iterations 23 Pass 17: suminf. 1.95667 obj. 20.5433 iterations 3 Pass 18: suminf. 1.21000 obj. 20.5433 iterations 2 Pass 19: suminf. 0.95667 obj. 20.5433 iterations 2 Pass 20: suminf. 3.45667 obj. 20.5433 iterations 27 Pass 21: suminf. 2.79000 obj. 20.5433 iterations 1 Before mini branch and bound, 91 integers at bound fixed and 108 continuous Full problem 168 rows 264 columns, reduced to 40 rows 51 columns Mini branch and bound did not improve solution (0.07 seconds) After 0.07 seconds - Feasibility pump exiting with objective of 9 - took 0.07 seconds Integer solution of 23 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Full problem 168 rows 264 columns, reduced to 24 rows 35 columns Integer solution of 21 found by combine solutions after 0 iterations and 0 nodes (0.08 seconds) 20 added rows had average density of 8.55 At root node, 20 cuts changed objective from 16.4333 to 20 in 5 passes Cut generator 0 (Probing) - 3 row cuts (0 active), 2 column cuts in 0.008 seconds - new frequency is 1 Cut generator 1 (Gomory) - 11 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 24 row cuts (7 active), 0 column cuts in -0.000 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) - 22 row cuts (3 active), 0 column cuts in -0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 12 row cuts (2 active), 0 column cuts in -0.000 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 40 row cuts (8 active), 0 column cuts in 0.004 seconds - new frequency is -100 Integer solution of 20 found after 64 iterations and 0 nodes (0.10 seconds) Search completed - best objective 20, took 64 iterations and 0 nodes (0.10 seconds) Maximum depth 0, 59 variables fixed on reduced cost Cuts at root node changed objective from 16.4333 to 20 Probing was tried 5 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) Gomory was tried 3 times and created 11 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) Knapsack was tried 5 times and created 24 cuts of which 7 were active after adding rounds of cuts (-0.000 seconds) Clique was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 5 times and created 22 cuts of which 3 were active after adding rounds of cuts (-0.000 seconds) FlowCover was tried 5 times and created 12 cuts of which 2 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 3 times and created 40 cuts of which 8 were active after adding rounds of cuts (0.004 seconds) 34 bounds tightened after postprocessing Result - Finished objective 20 after 0 nodes and 64 iterations - took 0.11 seconds (total time 0.11) Total time 0.12 Solved to optimality. MIP solution: 20 (0 nodes, 0.12 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 08/22/08 05:16:52 elapsed 0:00:00.154