--- Job ran10x10b Start 08/24/08 05:43:57 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 --- ran10x10b.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10b.gdx --- ran10x10b.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- ran10x10b.gms(123) 4 Mb --- Generating MIP model m --- ran10x10b.gms(124) 4 Mb --- 121 rows 201 columns 601 non-zeroes --- 100 discrete-columns --- Executing Cbc: elapsed 0:00:00.010 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 200 columns and 120 rows. 100 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 2613.47 - 0.00 seconds Optimal - objective value 2613.47 processed model has 120 rows, 200 columns (100 integer) and 400 elements Pass 1: suminf. 1.06873 (3) obj. 2766.1 iterations 22 Solution found of 3232 Before mini branch and bound, 95 integers at bound fixed and 95 continuous Mini branch and bound did not improve solution (0.01 seconds) Round again with cutoff of 3170.15 Pass 2: suminf. 1.06873 (3) obj. 2766.1 iterations 20 Pass 3: suminf. 0.18630 (1) obj. 3170.15 iterations 24 Pass 4: suminf. 0.35294 (1) obj. 3017.18 iterations 15 Pass 5: suminf. 2.13828 (7) obj. 3170.15 iterations 43 Pass 6: suminf. 1.37100 (4) obj. 3170.15 iterations 36 Pass 7: suminf. 0.73234 (3) obj. 3170.15 iterations 7 Pass 8: suminf. 1.19933 (3) obj. 3170.15 iterations 20 Pass 9: suminf. 1.75293 (8) obj. 3170.15 iterations 48 Pass 10: suminf. 1.35402 (8) obj. 3170.15 iterations 30 Pass 11: suminf. 2.09446 (8) obj. 3170.15 iterations 36 Pass 12: suminf. 1.63356 (6) obj. 3170.15 iterations 16 Pass 13: suminf. 1.79172 (6) obj. 3170.15 iterations 10 Pass 14: suminf. 1.79172 (6) obj. 3170.15 iterations 10 Pass 15: suminf. 1.94541 (6) obj. 3170.15 iterations 16 Pass 16: suminf. 1.76051 (8) obj. 3170.15 iterations 30 Pass 17: suminf. 1.13966 (6) obj. 3170.15 iterations 24 Pass 18: suminf. 1.57639 (6) obj. 3170.15 iterations 33 Pass 19: suminf. 1.20139 (6) obj. 3170.15 iterations 16 Pass 20: suminf. 1.12849 (6) obj. 3170.15 iterations 11 Pass 21: suminf. 1.35077 (6) obj. 3170.15 iterations 21 No solution found this major pass Before mini branch and bound, 70 integers at bound fixed and 71 continuous Full problem 120 rows 200 columns, reduced to 41 rows 55 columns Mini branch and bound did not improve solution (0.06 seconds) After 0.06 seconds - Feasibility pump exiting with objective of 3232 - took 0.06 seconds Integer solution of 3232 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Full problem 120 rows 200 columns, reduced to 0 rows 0 columns 32 added rows had average density of 65.8125 At root node, 32 cuts changed objective from 2613.47 to 2995.39 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 1.296 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 2367 row cuts, 0 column cuts (30 active) in 0.140 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 358 row cuts, 0 column cuts (2 active) in 0.068 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 301 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 229 row cuts, 0 column cuts (0 active) in 0.108 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 225 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is -100 Optimal - objective value 2995.39 Optimal - objective value 2995.39 After 0 nodes, 1 on tree, 3232 best solution, best possible 2995.39 (2.12 seconds) Full problem 120 rows 200 columns, reduced to 6 rows 7 columns Search completed - best objective 3073, took 3030 iterations and 26 nodes (2.64 seconds) Strong branching done 646 times (10425 iterations), fathomed 6 nodes and fixed 4 variables Maximum depth 8, 325 variables fixed on reduced cost Cuts at root node changed objective from 2613.47 to 2995.39 Probing was tried 113 times and created 7 cuts of which 5 were active after adding rounds of cuts (1.308 seconds) Gomory was tried 137 times and created 2418 cuts of which 47 were active after adding rounds of cuts (0.140 seconds) Knapsack was tried 142 times and created 435 cuts of which 26 were active after adding rounds of cuts (0.092 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 142 times and created 375 cuts of which 32 were active after adding rounds of cuts (0.008 seconds) FlowCover was tried 142 times and created 315 cuts of which 9 were active after adding rounds of cuts (0.124 seconds) TwoMirCuts was tried 100 times and created 225 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) Result - Finished objective 3073 after 26 nodes and 3030 iterations - took 2.64 seconds (total time 2.64) Total time 2.65 Solved to optimality. MIP solution: 3073 (26 nodes, 2.65 seconds) Best possible: 3073 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran10x10b.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10b.gms Stop 08/24/08 05:43:59 elapsed 0:00:02.698