--- Job pp08acuts Start 08/24/08 05:25:29 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 --- pp08acuts.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/pp08acuts.gdx --- pp08acuts.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- pp08acuts.gms(123) 4 Mb --- Generating MIP model m --- pp08acuts.gms(124) 4 Mb --- 247 rows 241 columns 1,016 non-zeroes --- 64 discrete-columns --- pp08acuts.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.013 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 240 columns and 246 rows. 64 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 5480.61 - 0.00 seconds Optimal - objective value 5480.61 processed model has 239 rows, 235 columns (64 integer) and 818 elements Pass 1: suminf. 4.71823 (19) obj. 9048.36 iterations 67 Pass 2: suminf. 2.31667 (11) obj. 9598.74 iterations 14 Pass 3: suminf. 1.81667 (7) obj. 9760.12 iterations 6 Solution found of 11196.8 Before mini branch and bound, 17 integers at bound fixed and 42 continuous Full problem 239 rows 235 columns, reduced to 174 rows 158 columns - too large Mini branch and bound did not improve solution (0.02 seconds) Round again with cutoff of 10625.2 Pass 4: suminf. 4.21823 (18) obj. 9051.13 iterations 65 Pass 5: suminf. 1.81667 (7) obj. 9797.62 iterations 21 Pass 6: suminf. 0.00000 (0) obj. 10625.2 iterations 18 Solution found of 10625.2 Before mini branch and bound, 18 integers at bound fixed and 43 continuous Full problem 239 rows 235 columns, reduced to 173 rows 156 columns - too large Mini branch and bound did not improve solution (0.04 seconds) After 0.04 seconds - Feasibility pump exiting with objective of 10625.2 - took 0.04 seconds Integer solution of 10240 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) Full problem 239 rows 235 columns, reduced to 96 rows 94 columns Integer solution of 8880 found by combine solutions after 0 iterations and 0 nodes (0.08 seconds) 45 added rows had average density of 119.489 At root node, 45 cuts changed objective from 5480.61 to 6787.29 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 37 column cuts (10 active) in 5.024 seconds - new frequency is 1 Cut generator 1 (Gomory) - 3103 row cuts, 0 column cuts (35 active) in 0.344 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 75 row cuts, 0 column cuts (0 active) in 0.060 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 15 row cuts, 0 column cuts (0 active) in 0.520 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 290 row cuts, 0 column cuts (0 active) in 0.072 seconds - new frequency is -100 Optimal - objective value 6787.29 Optimal - objective value 6787.29 After 0 nodes, 1 on tree, 8880 best solution, best possible 6787.29 (8.54 seconds) Integer solution of 8010 found after 12165 iterations and 162 nodes (15.42 seconds) Full problem 239 rows 235 columns, reduced to 151 rows 149 columns - too large Integer solution of 7540 found after 14970 iterations and 260 nodes (16.36 seconds) Full problem 239 rows 235 columns, reduced to 164 rows 162 columns - too large Integer solution of 7380 found after 17410 iterations and 349 nodes (17.03 seconds) Full problem 239 rows 235 columns, reduced to 170 rows 167 columns - too large Integer solution of 7360 found after 17468 iterations and 355 nodes (17.05 seconds) Full problem 239 rows 235 columns, reduced to 170 rows 167 columns - too large Integer solution of 7350 found after 17636 iterations and 373 nodes (17.09 seconds) Full problem 239 rows 235 columns, reduced to 171 rows 169 columns - too large After 1000 nodes, 97 on tree, 7350 best solution, best possible 7116.47 (19.65 seconds) After 2000 nodes, 69 on tree, 7350 best solution, best possible 7221.96 (23.25 seconds) Search completed - best objective 7350, took 51403 iterations and 2406 nodes (24.69 seconds) Strong branching done 5622 times (93285 iterations), fathomed 9 nodes and fixed 91 variables Maximum depth 49, 1578 variables fixed on reduced cost Cuts at root node changed objective from 5480.61 to 6787.29 Probing was tried 2437 times and created 140 cuts of which 79 were active after adding rounds of cuts (6.612 seconds) Gomory was tried 2257 times and created 8827 cuts of which 2432 were active after adding rounds of cuts (1.640 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 100 times and created 75 cuts of which 0 were active after adding rounds of cuts (0.060 seconds) FlowCover was tried 100 times and created 15 cuts of which 0 were active after adding rounds of cuts (0.520 seconds) TwoMirCuts was tried 100 times and created 290 cuts of which 0 were active after adding rounds of cuts (0.072 seconds) Result - Finished objective 7350 after 2406 nodes and 51403 iterations - took 24.69 seconds (total time 24.70) Total time 24.72 Solved to optimality. MIP solution: 7350 (2406 nodes, 24.72 seconds) Best possible: 7350 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- pp08acuts.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job pp08acuts.gms Stop 08/24/08 05:25:54 elapsed 0:00:24.816