--- Job vpm1 Start 08/21/08 16:00:31 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.032 --- 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.039 GAMS/CoinCbc 2.0 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.00.00, build Mar 20 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: obj. 3.26667 --> up = 0 , down = 0 -- rand = 9 ( 25) - solution found of 23 Before mini branch and bound, 102 integers at bound fixed and 122 continuous Full problem 168 rows 264 columns, reduced to 6 rows 7 columns Mini branch and bound improved solution from 23 to 21 (0.01 seconds) Round again with cutoff of 20.5433 Pass 2: obj. 3.26667 --> up = 0 , down = 0 -- rand = 9 ( 25) Pass 3: obj. 2.45667 --> up = 0 , down = 2 Pass 4: obj. 0.79000 --> up = 0 , down = 0 -- rand = 3 ( 21) Pass 5: obj. 0.50000 --> up = 0 , down = 0 -- rand = 1 ( 28) Pass 6: obj. 0.45667 --> up = 0 , down = 0 -- rand = 1 ( 16) perturbation applied Pass 7: obj. 19.79000 --> up = 3 , down = 17 Pass 8: obj. 0.45667 --> up = 0 , down = 0 -- rand = 2 ( 21) Pass 9: obj. 1.33333 --> up = 2 , down = 0 perturbation applied Pass 10: obj. 19.79000 --> up = 3 , down = 17 perturbation applied Pass 11: obj. 21.62333 --> up = 3 , down = 19 Pass 12: obj. 0.95667 --> up = 0 , down = 0 -- rand = 4 ( 21) Pass 13: obj. 2.12333 --> up = 2 , down = 0 Pass 14: obj. 1.12333 --> up = 0 , down = 0 -- rand = 4 ( 13) Pass 15: obj. 1.62333 --> up = 2 , down = 0 perturbation applied Pass 16: obj. 17.29000 --> up = 0 , down = 17 Pass 17: obj. 1.16667 --> up = 0 , down = 0 -- rand = 3 ( 22) Pass 18: obj. 1.45667 --> up = 0 , down = 2 Pass 19: obj. 0.79000 --> up = 0 , down = 0 -- rand = 3 ( 17) Pass 20: obj. 1.45667 --> up = 0 , down = 1 Pass 21: obj. 0.79000 --> No solution found this major pass Before mini branch and bound, 89 integers at bound fixed and 103 continuous Full problem 168 rows 264 columns, reduced to 38 rows 48 columns Mini branch and bound did not improve solution (0.07 seconds) After 0.07 seconds - Feasibility pump exiting - took 0.07 seconds Integer solution of 21 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Full problem 168 rows 264 columns, reduced to 4 rows 12 columns 23 added rows had average density of 13.2609 At root node, 23 cuts changed objective from 16.4333 to 19.5 in 35 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is 10 Cut generator 1 (Gomory) - 123 row cuts (3 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 53 row cuts (7 active), 0 column cuts in 0.024 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) - 25 row cuts (6 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 13 row cuts (2 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 40 row cuts (5 active), 0 column cuts in 0.004 seconds - new frequency is -100 After 0 nodes, 1 on tree, 21 best solution, best possible 19.5 (0.18 seconds) Integer solution of 20 found by rounding after 170 iterations and 2 nodes (0.19 seconds) Search completed - best objective 20, took 170 iterations and 2 nodes (0.19 seconds) Strong branching done 16 times (63 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 2, 39 variables fixed on reduced cost Cuts at root node changed objective from 16.4333 to 19.5 Probing was tried 35 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) Gomory was tried 36 times and created 127 cuts of which 6 were active after adding rounds of cuts (0.012 seconds) Knapsack was tried 37 times and created 53 cuts of which 7 were active after adding rounds of cuts (0.024 seconds) Clique was tried 35 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 35 times and created 25 cuts of which 6 were active after adding rounds of cuts (0.004 seconds) FlowCover was tried 35 times and created 13 cuts of which 2 were active after adding rounds of cuts (0.016 seconds) TwoMirCuts was tried 34 times and created 40 cuts of which 5 were active after adding rounds of cuts (0.004 seconds) Result - Finished objective 20 after 2 nodes and 170 iterations - took 0.20 seconds (total time 0.21) Total time 0.21 Solved to optimality. Writing solution. Objective: 20 Time: 0.2 s --- Restarting execution --- vpm1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job vpm1.gms Stop 08/21/08 16:00:32 elapsed 0:00:00.273