--- Job ran6x43 Start 08/24/08 06:44:05 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 --- ran6x43.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran6x43.gdx --- ran6x43.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.007 --- ran6x43.gms(123) 4 Mb --- Generating MIP model m --- ran6x43.gms(124) 4 Mb --- 308 rows 517 columns 1,549 non-zeroes --- 258 discrete-columns --- Executing Cbc: elapsed 0:00:00.016 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 516 columns and 307 rows. 258 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 6244.71 - 0.01 seconds Optimal - objective value 6244.71 processed model has 307 rows, 516 columns (258 integer) and 1032 elements Pass 1: suminf. 0.12511 (3) obj. 6270.98 iterations 113 Solution found of 6683 Before mini branch and bound, 250 integers at bound fixed and 249 continuous Full problem 307 rows 516 columns, reduced to 8 rows 10 columns Mini branch and bound improved solution from 6683 to 6565 (0.02 seconds) Round again with cutoff of 6532.97 Pass 2: suminf. 0.12511 (3) obj. 6270.98 iterations 76 Pass 3: suminf. 0.23454 (1) obj. 6532.97 iterations 56 Pass 4: suminf. 0.04082 (1) obj. 6495 iterations 21 Pass 5: suminf. 1.30263 (7) obj. 6532.97 iterations 83 Pass 6: suminf. 0.67187 (5) obj. 6532.97 iterations 41 Pass 7: suminf. 0.39230 (4) obj. 6532.97 iterations 22 Pass 8: suminf. 0.33400 (3) obj. 6532.97 iterations 28 Pass 9: suminf. 0.35637 (3) obj. 6532.97 iterations 41 Pass 10: suminf. 1.60233 (8) obj. 6532.97 iterations 72 Pass 11: suminf. 0.52427 (3) obj. 6532.97 iterations 102 Pass 12: suminf. 0.51703 (4) obj. 6532.97 iterations 92 Pass 13: suminf. 0.51703 (4) obj. 6532.97 iterations 34 Pass 14: suminf. 1.26580 (4) obj. 6532.97 iterations 76 Pass 15: suminf. 1.34426 (9) obj. 6532.97 iterations 100 Pass 16: suminf. 0.73636 (6) obj. 6532.97 iterations 36 Pass 17: suminf. 1.25378 (7) obj. 6532.97 iterations 97 Pass 18: suminf. 0.86108 (5) obj. 6532.97 iterations 46 Pass 19: suminf. 1.28414 (5) obj. 6532.97 iterations 98 Pass 20: suminf. 2.91989 (11) obj. 6532.97 iterations 61 Pass 21: suminf. 1.66503 (11) obj. 6532.97 iterations 35 No solution found this major pass Before mini branch and bound, 205 integers at bound fixed and 206 continuous Full problem 307 rows 516 columns, reduced to 66 rows 91 columns Mini branch and bound did not improve solution (0.15 seconds) After 0.15 seconds - Feasibility pump exiting with objective of 6565 - took 0.15 seconds Integer solution of 6565 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) Full problem 307 rows 516 columns, reduced to 0 rows 0 columns 16 added rows had average density of 279.75 At root node, 16 cuts changed objective from 6244.71 to 6288.63 in 15 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.048 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 206 row cuts, 0 column cuts (16 active) in 0.036 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 35 row cuts, 0 column cuts (0 active) in 0.008 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) - 41 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 17 row cuts, 0 column cuts (0 active) in 0.064 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 145 row cuts, 0 column cuts (0 active) in 0.044 seconds - new frequency is -100 Optimal - objective value 6288.63 Optimal - objective value 6288.63 After 0 nodes, 1 on tree, 6565 best solution, best possible 6288.63 (0.66 seconds) Full problem 307 rows 516 columns, reduced to 21 rows 26 columns Integer solution of 6562 found by combine solutions after 3013 iterations and 117 nodes (2.53 seconds) Full problem 307 rows 516 columns, reduced to 23 rows 29 columns Full problem 307 rows 516 columns, reduced to 27 rows 35 columns Full problem 307 rows 516 columns, reduced to 33 rows 44 columns Search completed - best objective 6330, took 4917 iterations and 276 nodes (3.22 seconds) Strong branching done 1346 times (15621 iterations), fathomed 13 nodes and fixed 39 variables Maximum depth 30, 4934 variables fixed on reduced cost Cuts at root node changed objective from 6244.71 to 6288.63 Probing was tried 30 times and created 6 cuts of which 2 were active after adding rounds of cuts (0.052 seconds) Gomory was tried 184 times and created 215 cuts of which 19 were active after adding rounds of cuts (0.108 seconds) Knapsack was tried 192 times and created 104 cuts of which 42 were active after adding rounds of cuts (0.080 seconds) Clique was tried 15 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 192 times and created 189 cuts of which 96 were active after adding rounds of cuts (0.064 seconds) FlowCover was tried 15 times and created 17 cuts of which 0 were active after adding rounds of cuts (0.064 seconds) TwoMirCuts was tried 15 times and created 145 cuts of which 0 were active after adding rounds of cuts (0.044 seconds) Result - Finished objective 6330 after 276 nodes and 4917 iterations - took 3.24 seconds (total time 3.25) Total time 3.26 Solved to optimality. MIP solution: 6330 (276 nodes, 3.26 seconds) Best possible: 6330 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran6x43.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran6x43.gms Stop 08/24/08 06:44:08 elapsed 0:00:03.441