--- Job vpm1 Start 08/24/08 09:03:26 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.009 --- 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.016 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 15.4167 - 0.00 seconds Optimal - objective value 15.4167 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 (10) obj. 17.2667 iterations 18 Pass 2: suminf. 2.26667 (8) 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 19 Pass 3: suminf. 2.76667 (10) obj. 17.2667 iterations 17 Pass 4: suminf. 2.26667 (8) obj. 17.2667 iterations 2 Pass 5: suminf. 1.33333 (6) obj. 19 iterations 13 Pass 6: suminf. 1.16667 (6) obj. 19 iterations 4 Pass 7: suminf. 1.50000 (6) obj. 19 iterations 6 Pass 8: suminf. 1.50000 (6) obj. 19 iterations 2 Pass 9: suminf. 1.50000 (6) obj. 19 iterations 1 Pass 10: suminf. 1.83333 (7) obj. 19 iterations 26 Pass 11: suminf. 1.33333 (6) obj. 19 iterations 12 Pass 12: suminf. 0.83333 (5) obj. 19 iterations 10 Pass 13: suminf. 0.83333 (5) obj. 19 iterations 4 Pass 14: suminf. 0.83333 (5) obj. 19 iterations 7 Pass 15: suminf. 0.83333 (5) obj. 19 iterations 4 Pass 16: suminf. 0.83333 (4) obj. 19 iterations 5 Pass 17: suminf. 2.16667 (6) obj. 19 iterations 17 Pass 18: suminf. 1.33333 (4) obj. 19 iterations 12 Pass 19: suminf. 1.50000 (4) obj. 19 iterations 7 Pass 20: suminf. 3.33333 (12) obj. 19 iterations 28 Pass 21: suminf. 2.16667 (7) obj. 19 iterations 11 Pass 22: suminf. 2.16667 (7) obj. 19 iterations 7 No solution found this major pass Before mini branch and bound, 88 integers at bound fixed and 96 continuous Full problem 168 rows 257 columns, reduced to 46 rows 62 columns Mini branch and bound did not improve solution (0.07 seconds) After 0.07 seconds - Feasibility pump exiting with objective of 21 - 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 257 columns, reduced to 13 rows 20 columns 22 added rows had average density of 8.68182 At root node, 22 cuts changed objective from 16.4333 to 20 in 5 passes Cut generator 0 (Probing) - 0 row cuts, 2 column cuts (1 active) in 0.008 seconds - new frequency is 1 Cut generator 1 (Gomory) - 46 row cuts, 0 column cuts (21 active) in 0.000 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 23 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 19 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 9 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 50 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Integer solution of 20 found after 57 iterations and 0 nodes (0.10 seconds) Optimal - objective value 20 Optimal - objective value 20 Search completed - best objective 20, took 57 iterations and 0 nodes (0.10 seconds) Maximum depth 0, 22 variables fixed on reduced cost Cuts at root node changed objective from 16.4333 to 20 Probing was tried 5 times and created 2 cuts of which 1 were active after adding rounds of cuts (0.008 seconds) Gomory was tried 5 times and created 46 cuts of which 21 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 5 times and created 23 cuts of which 0 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 19 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 5 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 5 times and created 50 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) implication was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts 8 bounds tightened after postprocessing Result - Finished objective 20 after 0 nodes and 57 iterations - took 0.11 seconds (total time 0.12) Total time 0.12 Solved to optimality. MIP solution: 20 (0 nodes, 0.13 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/24/08 09:03:26 elapsed 0:00:00.164