--- Job ran10x10a Start 08/24/08 05:43:52 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 --- ran10x10a.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10a.gdx --- ran10x10a.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- ran10x10a.gms(123) 4 Mb --- Generating MIP model m --- ran10x10a.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 1252.74 - 0.00 seconds Optimal - objective value 1252.74 processed model has 120 rows, 200 columns (100 integer) and 400 elements Pass 1: suminf. 1.36795 (5) obj. 1352.31 iterations 23 Solution found of 1736 Before mini branch and bound, 91 integers at bound fixed and 91 continuous Mini branch and bound did not improve solution (0.00 seconds) Round again with cutoff of 1687.67 Pass 2: suminf. 1.36795 (5) obj. 1352.31 iterations 18 Pass 3: suminf. 0.26848 (1) obj. 1687.67 iterations 37 Pass 4: suminf. 0.07692 (1) obj. 1569.85 iterations 12 Pass 5: suminf. 1.91414 (5) obj. 1687.67 iterations 52 Pass 6: suminf. 1.10577 (3) obj. 1660.5 iterations 21 Pass 7: suminf. 0.74655 (3) obj. 1687.67 iterations 16 Pass 8: suminf. 0.74146 (4) obj. 1687.67 iterations 8 Pass 9: suminf. 0.83508 (3) obj. 1687.67 iterations 21 Pass 10: suminf. 1.72484 (8) obj. 1687.67 iterations 41 Pass 11: suminf. 1.22051 (6) obj. 1687.67 iterations 21 Pass 12: suminf. 1.63910 (6) obj. 1687.67 iterations 20 Pass 13: suminf. 1.15945 (5) obj. 1687.67 iterations 11 Pass 14: suminf. 1.10096 (4) obj. 1655.39 iterations 13 Pass 15: suminf. 0.99923 (3) obj. 1687.67 iterations 27 Pass 16: suminf. 0.99923 (3) obj. 1687.67 iterations 17 Pass 17: suminf. 0.99990 (3) obj. 1687.67 iterations 28 Pass 18: suminf. 0.99990 (3) obj. 1687.67 iterations 11 Pass 19: suminf. 1.27374 (4) obj. 1687.67 iterations 28 Pass 20: suminf. 0.99990 (3) obj. 1687.67 iterations 30 Pass 21: suminf. 1.98029 (6) obj. 1687.67 iterations 37 No solution found this major pass Before mini branch and bound, 66 integers at bound fixed and 64 continuous Full problem 120 rows 200 columns, reduced to 48 rows 65 columns Mini branch and bound did not improve solution (0.08 seconds) After 0.08 seconds - Feasibility pump exiting with objective of 1736 - took 0.08 seconds Integer solution of 1736 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Full problem 120 rows 200 columns, reduced to 0 rows 0 columns 27 added rows had average density of 88.7407 At root node, 27 cuts changed objective from 1252.74 to 1469.22 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 2.080 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 2610 row cuts, 0 column cuts (23 active) in 0.152 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 123 row cuts, 0 column cuts (2 active) in 0.048 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) - 227 row cuts, 0 column cuts (2 active) in 0.024 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 208 row cuts, 0 column cuts (0 active) in 0.164 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 196 row cuts, 0 column cuts (0 active) in 0.028 seconds - new frequency is -100 Optimal - objective value 1469.22 Optimal - objective value 1469.22 After 0 nodes, 1 on tree, 1736 best solution, best possible 1469.22 (2.89 seconds) Full problem 120 rows 200 columns, reduced to 27 rows 31 columns Full problem 120 rows 200 columns, reduced to 41 rows 50 columns Search completed - best objective 1499, took 4880 iterations and 78 nodes (4.47 seconds) Strong branching done 1810 times (21882 iterations), fathomed 13 nodes and fixed 42 variables Maximum depth 10, 826 variables fixed on reduced cost Cuts at root node changed objective from 1252.74 to 1469.22 Probing was tried 134 times and created 74 cuts of which 28 were active after adding rounds of cuts (2.096 seconds) Gomory was tried 208 times and created 2779 cuts of which 68 were active after adding rounds of cuts (0.196 seconds) Knapsack was tried 223 times and created 326 cuts of which 63 were active after adding rounds of cuts (0.080 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 223 times and created 437 cuts of which 98 were active after adding rounds of cuts (0.040 seconds) FlowCover was tried 223 times and created 450 cuts of which 22 were active after adding rounds of cuts (0.224 seconds) TwoMirCuts was tried 100 times and created 196 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) Result - Finished objective 1499 after 78 nodes and 4880 iterations - took 4.48 seconds (total time 4.48) Total time 4.48 Solved to optimality. MIP solution: 1499 (78 nodes, 4.48 seconds) Best possible: 1499 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran10x10a.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10a.gms Stop 08/24/08 05:43:57 elapsed 0:00:04.529