--- Job vpm2 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 --- vpm2.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/vpm2.gdx --- vpm2.gms(147) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- vpm2.gms(123) 4 Mb --- Generating MIP model m --- vpm2.gms(124) 4 Mb --- 235 rows 379 columns 1,086 non-zeroes --- 168 discrete-columns --- vpm2.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.013 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 9.88926 - 0.00 seconds 0 fixed, 67 tightened bounds, 120 strengthened rows, 0 substitutions processed model has 168 rows, 264 columns (120 integer) and 641 elements Objective coefficients multiple of 0.25 Cutoff increment increased from 1e-05 to 0.24975 Pass 1: suminf. 1.43074 obj. 12.3908 iterations 59 Pass 2: suminf. 0.05714 obj. 18.0714 iterations 26 Solution found of 19.25 Before mini branch and bound, 97 integers at bound fixed and 112 continuous Full problem 168 rows 264 columns, reduced to 36 rows 38 columns Mini branch and bound improved solution from 19.25 to 17 (0.01 seconds) Round again with cutoff of 16.4136 Pass 3: suminf. 1.43074 obj. 12.3908 iterations 56 Pass 4: suminf. 0.53085 obj. 16.4136 iterations 21 Pass 5: suminf. 0.30186 obj. 16.4136 iterations 3 Pass 6: suminf. 0.47867 obj. 16.4136 iterations 3 Pass 7: suminf. 2.32541 obj. 16.4136 iterations 42 Pass 8: suminf. 0.99358 obj. 16.4136 iterations 9 Pass 9: suminf. 0.98287 obj. 16.4136 iterations 17 Pass 10: suminf. 0.67589 obj. 16.4136 iterations 11 Pass 11: suminf. 1.33739 obj. 16.4136 iterations 15 Pass 12: suminf. 0.76683 obj. 16.4136 iterations 9 Pass 13: suminf. 1.72731 obj. 16.4136 iterations 12 Pass 14: suminf. 1.42158 obj. 16.4136 iterations 2 Pass 15: suminf. 0.94100 obj. 16.4136 iterations 16 Pass 16: suminf. 0.49772 obj. 16.4136 iterations 4 Pass 17: suminf. 0.17391 obj. 16.4136 iterations 10 Pass 18: suminf. 0.14035 obj. 16.3202 iterations 5 Pass 19: suminf. 0.42929 obj. 16.4136 iterations 11 Pass 20: suminf. 0.35051 obj. 16.4136 iterations 19 Pass 21: suminf. 0.26633 obj. 16.4136 iterations 11 Pass 22: suminf. 0.67213 obj. 16.4136 iterations 27 Before mini branch and bound, 84 integers at bound fixed and 96 continuous Full problem 168 rows 264 columns, reduced to 58 rows 72 columns Mini branch and bound improved solution from 17 to 14 (0.11 seconds) After 0.11 seconds - Feasibility pump exiting with objective of 14 - took 0.11 seconds Integer solution of 14 found by feasibility pump after 0 iterations and 0 nodes (0.11 seconds) Full problem 168 rows 264 columns, reduced to 33 rows 47 columns 35 added rows had average density of 20.2 At root node, 35 cuts changed objective from 11.1356 to 12.9796 in 12 passes Cut generator 0 (Probing) - 1 row cuts (1 active), 0 column cuts in 0.032 seconds - new frequency is 4 Cut generator 1 (Gomory) - 15 row cuts (2 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 59 row cuts (10 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) - 49 row cuts (13 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 21 row cuts (2 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 83 row cuts (7 active), 0 column cuts in -0.000 seconds - new frequency is -100 After 0 nodes, 1 on tree, 14 best solution, best possible 12.9796 (0.24 seconds) Full problem 168 rows 264 columns, reduced to 54 rows 73 columns Strong branching is fixing too many variables, too expensively! Search completed - best objective 13.75, took 2376 iterations and 177 nodes (1.94 seconds) Strong branching done 2832 times (18118 iterations), fathomed 52 nodes and fixed 127 variables Maximum depth 15, 1236 variables fixed on reduced cost Cuts at root node changed objective from 11.1356 to 12.9796 Probing was tried 53 times and created 46 cuts of which 22 were active after adding rounds of cuts (0.048 seconds) Gomory was tried 9 times and created 15 cuts of which 2 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 170 times and created 126 cuts of which 16 were active after adding rounds of cuts (0.068 seconds) Clique was tried 12 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 170 times and created 277 cuts of which 162 were active after adding rounds of cuts (0.028 seconds) FlowCover was tried 170 times and created 129 cuts of which 47 were active after adding rounds of cuts (0.072 seconds) TwoMirCuts was tried 9 times and created 83 cuts of which 7 were active after adding rounds of cuts (-0.000 seconds) 101 bounds tightened after postprocessing Result - Finished objective 13.75 after 177 nodes and 2376 iterations - took 1.96 seconds (total time 1.96) Total time 1.97 Solved to optimality. MIP solution: 13.75 (177 nodes, 1.97 seconds) Best possible: 13.75 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- vpm2.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job vpm2.gms Stop 08/22/08 05:16:54 elapsed 0:00:02.016