--- Job p2756 Start 08/24/08 05:20:45 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 --- p2756.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p2756.gdx --- p2756.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.020 --- p2756.gms(123) 4 Mb --- Generating MIP model m --- p2756.gms(124) 5 Mb --- 756 rows 2,757 columns 11,104 non-zeroes --- 2,756 discrete-columns --- p2756.gms(124) 5 Mb --- Executing Cbc: elapsed 0:00:00.062 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 2756 columns and 755 rows. 2756 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 2688.75 - 0.02 seconds Optimal - objective value 2688.75 23 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 23 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 710 rows, 2620 columns (2620 integer) and 8287 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 2.64206 (25) obj. 2705.12 iterations 12 Pass 2: suminf. 0.86010 (5) obj. 5691.88 iterations 31 Pass 3: suminf. 0.60902 (5) obj. 5691.06 iterations 2 Pass 4: suminf. 0.44952 (4) obj. 5935 iterations 5 Pass 5: suminf. 0.20134 (4) obj. 5935 iterations 1 Pass 6: suminf. 0.71615 (4) obj. 5935 iterations 4 Pass 7: suminf. 0.46797 (4) obj. 5935 iterations 1 Pass 8: suminf. 8.12790 (77) obj. 62473.3 iterations 448 Pass 9: suminf. 8.03201 (77) obj. 62430.1 iterations 25 Pass 10: suminf. 4.96627 (66) obj. 71788.5 iterations 12 Pass 11: suminf. 4.96627 (66) obj. 71788.5 iterations 0 Pass 12: suminf. 3.25351 (56) obj. 81960.9 iterations 15 Pass 13: suminf. 3.25351 (56) obj. 81960.9 iterations 0 Pass 14: suminf. 0.78796 (36) obj. 115821 iterations 26 Pass 15: suminf. 0.24560 (26) obj. 117747 iterations 17 Pass 16: suminf. 0.44179 (25) obj. 117747 iterations 15 Pass 17: suminf. 0.83577 (25) obj. 117747 iterations 22 Pass 18: suminf. 0.35153 (25) obj. 117747 iterations 18 Pass 19: suminf. 0.24507 (25) obj. 117747 iterations 11 Pass 20: suminf. 0.87953 (25) obj. 117747 iterations 19 No solution found this major pass Before mini branch and bound, 2188 integers at bound fixed and 0 continuous Mini branch and bound did not improve solution (0.07 seconds) After 0.07 seconds - Feasibility pump exiting - took 0.07 seconds 212 added rows had average density of 25.0283 At root node, 212 cuts changed objective from 2701.14 to 3117.91 in 16 passes Cut generator 0 (Probing) - 245 row cuts, 3 column cuts (197 active) in 0.656 seconds - new frequency is 1 Cut generator 1 (Gomory) - 170 row cuts, 0 column cuts (14 active) in 0.040 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 416 row cuts, 0 column cuts (1 active) in 0.008 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 81 row cuts, 0 column cuts (0 active) in 0.040 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 299 row cuts, 0 column cuts (0 active) in 0.056 seconds - new frequency is -100 Optimal - objective value 3117.91 Optimal - objective value 3117.91 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 3117.91 (1.08 seconds) After 100 nodes, 53 on tree, 1e+50 best solution, best possible 3121.6 (6.52 seconds) Integer solution of 3142 found after 4791 iterations and 128 nodes (7.92 seconds) Integer solution of 3128 found after 6366 iterations and 185 nodes (9.38 seconds) Full problem 710 rows 2620 columns, reduced to 0 rows 0 columns After 200 nodes, 9 on tree, 3125 best solution, best possible 3121.63 (9.64 seconds) Search completed - best objective 3124, took 6962 iterations and 208 nodes (9.76 seconds) Strong branching done 1858 times (15554 iterations), fathomed 2 nodes and fixed 14 variables Maximum depth 11, 29348 variables fixed on reduced cost Cuts at root node changed objective from 2701.14 to 3117.91 Probing was tried 377 times and created 756 cuts of which 530 were active after adding rounds of cuts (1.344 seconds) Gomory was tried 377 times and created 569 cuts of which 129 were active after adding rounds of cuts (0.500 seconds) Knapsack was tried 377 times and created 1688 cuts of which 283 were active after adding rounds of cuts (0.340 seconds) Clique was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) MixedIntegerRounding2 was tried 377 times and created 932 cuts of which 96 were active after adding rounds of cuts (0.772 seconds) FlowCover was tried 16 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) TwoMirCuts was tried 16 times and created 299 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) implication was tried 361 times and created 2012 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 3124 after 208 nodes and 6962 iterations - took 9.95 seconds (total time 9.97) Total time 9.99 Solved to optimality. MIP solution: 3124 (208 nodes, 9.99 seconds) Best possible: 3124 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- p2756.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p2756.gms Stop 08/24/08 05:20:55 elapsed 0:00:10.126