--- Job p0282 Start 08/24/08 05:20:35 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 --- p0282.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0282.gdx --- p0282.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- p0282.gms(123) 4 Mb --- Generating MIP model m --- p0282.gms(124) 4 Mb --- 242 rows 283 columns 2,249 non-zeroes --- 282 discrete-columns --- p0282.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.016 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 282 columns and 241 rows. 282 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 176868 - 0.00 seconds Optimal - objective value 176868 processed model has 161 rows, 202 columns (202 integer) and 1284 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 1.97059 (10) obj. 228825 iterations 18 Solution found of 564656 Before mini branch and bound, 177 integers at bound fixed and 0 continuous Mini branch and bound did not improve solution (0.02 seconds) Round again with cutoff of 526189 Pass 2: suminf. 1.87092 (9) obj. 214649 iterations 24 Solution found of 426082 Before mini branch and bound, 178 integers at bound fixed and 0 continuous Full problem 161 rows 202 columns, reduced to 8 rows 10 columns Mini branch and bound improved solution from 426082 to 346980 (0.03 seconds) After 0.03 seconds - Feasibility pump exiting with objective of 346980 - took 0.03 seconds Integer solution of 346980 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) Full problem 161 rows 202 columns, reduced to 25 rows 52 columns Integer solution of 341650 found by combine solutions after 0 iterations and 0 nodes (0.04 seconds) Integer solution of 340170 found by combine solutions after 3344 iterations and 0 nodes (4.51 seconds) 48 added rows had average density of 37.2917 At root node, 48 cuts changed objective from 180000 to 257060 in 100 passes Cut generator 0 (Probing) - 330 row cuts, 0 column cuts (38 active) in 3.708 seconds - new frequency is 1 Cut generator 1 (Gomory) - 3780 row cuts, 0 column cuts (10 active) in 0.172 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 883 row cuts, 0 column cuts (0 active) in 0.072 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 851 row cuts, 0 column cuts (0 active) in 0.072 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 761 row cuts, 0 column cuts (0 active) in 0.056 seconds - new frequency is -100 Optimal - objective value 257060 Optimal - objective value 257060 After 0 nodes, 1 on tree, 340170 best solution, best possible 257060 (4.67 seconds) Full problem 161 rows 202 columns, reduced to 36 rows 57 columns Integer solution of 309205 found by combine solutions after 5868 iterations and 33 nodes (5.55 seconds) Integer solution of 309035 found by combine solutions after 5987 iterations and 34 nodes (5.58 seconds) Strong branching is fixing too many variables, too expensively! Full problem 161 rows 202 columns, reduced to 39 rows 63 columns Integer solution of 258860 found by combine solutions after 11634 iterations and 84 nodes (7.22 seconds) Search completed - best objective 258411, took 11758 iterations and 88 nodes (7.26 seconds) Strong branching done 3342 times (40743 iterations), fathomed 4 nodes and fixed 60 variables Maximum depth 7, 791 variables fixed on reduced cost Cuts at root node changed objective from 180000 to 257060 Probing was tried 264 times and created 1162 cuts of which 537 were active after adding rounds of cuts (3.872 seconds) Gomory was tried 264 times and created 5803 cuts of which 510 were active after adding rounds of cuts (0.232 seconds) Knapsack was tried 264 times and created 4012 cuts of which 213 were active after adding rounds of cuts (0.176 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 264 times and created 2650 cuts of which 19 were active after adding rounds of cuts (0.204 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) TwoMirCuts was tried 100 times and created 761 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) implication was tried 164 times and created 30603 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 258411 after 88 nodes and 11758 iterations - took 7.27 seconds (total time 7.28) Total time 7.28 Solved to optimality. MIP solution: 258411 (88 nodes, 7.28 seconds) Best possible: 258411 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- p0282.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0282.gms Stop 08/24/08 05:20:42 elapsed 0:00:07.339