--- Job vpm2 Start 08/21/08 16:00:32 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 --- 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.008 --- 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.015 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 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: obj. 1.97174 --> up = 0 , down = 0 -- rand = 8 ( 12) Pass 2: obj. -0.00000 --> up = 0 , down = 0 -- rand = 0 ( 11) - solution found of 15.75 Before mini branch and bound, 96 integers at bound fixed and 113 continuous Full problem 168 rows 264 columns, reduced to 21 rows 23 columns Mini branch and bound improved solution from 15.75 to 15.25 (0.01 seconds) Round again with cutoff of 14.8386 Pass 3: obj. 1.97174 --> up = 0 , down = 0 -- rand = 8 ( 12) Pass 4: obj. 0.88763 --> up = 0 , down = 1 Pass 5: obj. 0.36347 --> up = 0 , down = 0 -- rand = 4 ( 15) Pass 6: obj. 1.24494 --> up = 0 , down = 1 Pass 7: obj. 0.29167 --> up = 0 , down = 0 -- rand = 1 ( 14) Pass 8: obj. 0.63763 --> up = 0 , down = 1 perturbation applied Pass 9: obj. 16.89705 --> up = 1 , down = 17 Pass 10: obj. 1.78392 --> up = 0 , down = 0 -- rand = 6 ( 16) Pass 11: obj. 3.22810 --> up = 0 , down = 4 Pass 12: obj. 1.04167 --> up = 0 , down = 0 -- rand = 4 ( 15) Pass 13: obj. 2.39477 --> up = 0 , down = 3 Pass 14: obj. 0.81144 --> up = 0 , down = 0 -- rand = 5 ( 28) Pass 15: obj. 3.74834 --> up = 3 , down = 1 Pass 16: obj. 0.95795 --> up = 0 , down = 0 -- rand = 7 ( 16) Pass 17: obj. 4.46637 --> up = 4 , down = 1 Pass 18: obj. 1.02977 --> up = 0 , down = 0 -- rand = 6 ( 24) Pass 19: obj. 1.45736 --> up = 1 , down = 0 Pass 20: obj. 0.56713 --> up = 0 , down = 0 -- rand = 4 ( 18) Pass 21: obj. 1.59527 --> up = 1 , down = 0 Pass 22: obj. 0.90665 --> No solution found this major pass Before mini branch and bound, 84 integers at bound fixed and 96 continuous Full problem 168 rows 264 columns, reduced to 52 rows 66 columns Mini branch and bound did not improve solution (0.10 seconds) After 0.10 seconds - Feasibility pump exiting - took 0.10 seconds Integer solution of 15.25 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) Full problem 168 rows 264 columns, reduced to 14 rows 20 columns Integer solution of 14.75 found by combine solutions after 3002 iterations and 0 nodes (2.05 seconds) 33 added rows had average density of 65.8788 At root node, 33 cuts changed objective from 11.1356 to 13.029 in 100 passes Cut generator 0 (Probing) - 4 row cuts (1 active), 0 column cuts in 0.924 seconds - new frequency is 7 Cut generator 1 (Gomory) - 2115 row cuts (12 active), 0 column cuts in 0.152 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 220 row cuts (10 active), 0 column cuts in 0.068 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 259 row cuts (6 active), 0 column cuts in 0.028 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 67 row cuts (1 active), 0 column cuts in 0.120 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 171 row cuts (3 active), 0 column cuts in 0.036 seconds - new frequency is -100 After 0 nodes, 1 on tree, 14.75 best solution, best possible 13.029 (2.14 seconds) Integer solution of 14.25 found after 6587 iterations and 157 nodes (4.97 seconds) Full problem 168 rows 264 columns, reduced to 29 rows 43 columns Integer solution of 14 found by combine solutions after 6637 iterations and 158 nodes (5.00 seconds) Integer solution of 13.75 found by rounding after 9364 iterations and 298 nodes (5.88 seconds) Full problem 168 rows 264 columns, reduced to 46 rows 65 columns Search completed - best objective 13.75, took 16023 iterations and 799 nodes (8.64 seconds) Strong branching done 5332 times (48645 iterations), fathomed 87 nodes and fixed 376 variables Maximum depth 22, 5419 variables fixed on reduced cost Cuts at root node changed objective from 11.1356 to 13.029 Probing was tried 196 times and created 228 cuts of which 84 were active after adding rounds of cuts (0.988 seconds) Gomory was tried 661 times and created 3306 cuts of which 403 were active after adding rounds of cuts (0.328 seconds) Knapsack was tried 100 times and created 220 cuts of which 10 were active after adding rounds of cuts (0.068 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 734 times and created 1488 cuts of which 661 were active after adding rounds of cuts (0.188 seconds) FlowCover was tried 100 times and created 67 cuts of which 1 were active after adding rounds of cuts (0.120 seconds) TwoMirCuts was tried 100 times and created 171 cuts of which 3 were active after adding rounds of cuts (0.036 seconds) Result - Finished objective 13.75 after 799 nodes and 16023 iterations - took 8.65 seconds (total time 8.66) Total time 8.66 Solved to optimality. Writing solution. Objective: 13.75 Time: 8.66 s --- Restarting execution --- vpm2.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job vpm2.gms Stop 08/21/08 16:00:40 elapsed 0:00:08.736