--- Job pp08a Start 08/24/08 05:25:54 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 --- pp08a.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/pp08a.gdx --- pp08a.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- pp08a.gms(123) 4 Mb --- Generating MIP model m --- pp08a.gms(124) 4 Mb --- 137 rows 241 columns 657 non-zeroes --- 64 discrete-columns --- Executing Cbc: elapsed 0:00:00.010 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 240 columns and 136 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 2748.35 - 0.00 seconds Optimal - objective value 2748.35 processed model has 133 rows, 234 columns (64 integer) and 468 elements Pass 1: suminf. 5.83690 (24) obj. 8872.14 iterations 46 Pass 2: suminf. 0.83690 (6) obj. 10965.2 iterations 27 Pass 3: suminf. 0.43690 (4) obj. 10661.7 iterations 8 Solution found of 11280 Before mini branch and bound, 6 integers at bound fixed and 55 continuous Full problem 133 rows 234 columns, reduced to 105 rows 151 columns - too large Mini branch and bound did not improve solution (0.01 seconds) Round again with cutoff of 10426.8 Pass 4: suminf. 5.05357 (22) obj. 8851.96 iterations 46 Pass 5: suminf. 0.59795 (7) obj. 10426.8 iterations 32 Pass 6: suminf. 0.49548 (5) obj. 10426.8 iterations 6 Pass 7: suminf. 0.00000 (0) obj. 10426.8 iterations 25 Solution found of 10426.8 Before mini branch and bound, 7 integers at bound fixed and 50 continuous Full problem 133 rows 234 columns, reduced to 106 rows 157 columns - too large Mini branch and bound did not improve solution (0.02 seconds) After 0.02 seconds - Feasibility pump exiting with objective of 10426.8 - took 0.02 seconds Integer solution of 10250 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) Full problem 133 rows 234 columns, reduced to 36 rows 60 columns Integer solution of 9670 found by combine solutions after 0 iterations and 0 nodes (0.03 seconds) 72 added rows had average density of 72.8472 At root node, 72 cuts changed objective from 2748.35 to 6837.57 in 100 passes Cut generator 0 (Probing) - 42 row cuts, 30 column cuts (20 active) in 3.024 seconds - new frequency is 1 Cut generator 1 (Gomory) - 2930 row cuts, 0 column cuts (52 active) in 0.276 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 326 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 35 row cuts, 0 column cuts (0 active) in 0.476 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 266 row cuts, 0 column cuts (0 active) in 0.040 seconds - new frequency is -100 Optimal - objective value 6837.57 Optimal - objective value 6837.57 After 0 nodes, 1 on tree, 9670 best solution, best possible 6837.57 (5.23 seconds) Integer solution of 8650 found after 11053 iterations and 159 nodes (10.94 seconds) Full problem 133 rows 234 columns, reduced to 82 rows 132 columns Integer solution of 7780 found by combine solutions after 11054 iterations and 160 nodes (11.67 seconds) Integer solution of 7570 found after 13376 iterations and 230 nodes (12.42 seconds) Full problem 133 rows 234 columns, reduced to 97 rows 162 columns - too large Integer solution of 7450 found after 15215 iterations and 298 nodes (12.93 seconds) Full problem 133 rows 234 columns, reduced to 98 rows 164 columns - too large Integer solution of 7440 found after 21157 iterations and 536 nodes (14.69 seconds) Full problem 133 rows 234 columns, reduced to 99 rows 166 columns - too large Integer solution of 7350 found after 23139 iterations and 652 nodes (15.16 seconds) Full problem 133 rows 234 columns, reduced to 99 rows 166 columns - too large After 1000 nodes, 118 on tree, 7350 best solution, best possible 7293.03 (17.31 seconds) Search completed - best objective 7350, took 41323 iterations and 1702 nodes (19.53 seconds) Strong branching done 5650 times (83860 iterations), fathomed 5 nodes and fixed 111 variables Maximum depth 35, 1691 variables fixed on reduced cost Cuts at root node changed objective from 2748.35 to 6837.57 Probing was tried 2187 times and created 454 cuts of which 299 were active after adding rounds of cuts (4.428 seconds) Gomory was tried 1911 times and created 6844 cuts of which 1913 were active after adding rounds of cuts (1.236 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) MixedIntegerRounding2 was tried 2187 times and created 2406 cuts of which 772 were active after adding rounds of cuts (0.316 seconds) FlowCover was tried 100 times and created 35 cuts of which 0 were active after adding rounds of cuts (0.476 seconds) TwoMirCuts was tried 100 times and created 266 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) Result - Finished objective 7350 after 1702 nodes and 41323 iterations - took 19.54 seconds (total time 19.55) Total time 19.56 Solved to optimality. MIP solution: 7350 (1702 nodes, 19.56 seconds) Best possible: 7350 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- pp08a.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job pp08a.gms Stop 08/24/08 05:26:14 elapsed 0:00:20.002