--- Job misc03 Start 08/24/08 03:24:58 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 --- misc03.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/misc03.gdx --- misc03.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- misc03.gms(123) 4 Mb --- Generating MIP model m --- misc03.gms(124) 4 Mb --- 97 rows 161 columns 2,055 non-zeroes --- 159 discrete-columns --- Executing Cbc: elapsed 0:00:00.013 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 160 columns and 96 rows. 159 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 1910 - 0.00 seconds Optimal - objective value 1910 15 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 15 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 95 rows, 138 columns (138 integer) and 1824 elements Objective coefficients multiple of 5 Cutoff increment increased from 1e-05 to 4.995 Pass 1: suminf. 6.00000 (12) obj. 1910 iterations 25 Pass 2: suminf. 6.00000 (12) obj. 1910 iterations 16 Pass 3: suminf. 6.00000 (12) obj. 1910 iterations 10 Pass 4: suminf. 6.00000 (12) obj. 1910 iterations 2 Pass 5: suminf. 6.00000 (12) obj. 1910 iterations 7 Pass 6: suminf. 6.00000 (12) obj. 1910 iterations 5 Pass 7: suminf. 6.00000 (12) obj. 1910 iterations 13 Pass 8: suminf. 6.00000 (12) obj. 1910 iterations 20 Pass 9: suminf. 6.00000 (12) obj. 1910 iterations 0 Pass 10: suminf. 6.00000 (12) obj. 1910 iterations 22 Pass 11: suminf. 6.00000 (12) obj. 1910 iterations 21 Pass 12: suminf. 6.00000 (12) obj. 1910 iterations 7 Pass 13: suminf. 6.00000 (12) obj. 1910 iterations 7 Pass 14: suminf. 7.30303 (27) obj. 3260.68 iterations 46 Pass 15: suminf. 6.66667 (14) obj. 3292.5 iterations 12 Pass 16: suminf. 6.66667 (14) obj. 3292.5 iterations 7 Pass 17: suminf. 6.66667 (14) obj. 3292.5 iterations 10 Pass 18: suminf. 5.88889 (24) obj. 3651.67 iterations 22 Pass 19: suminf. 5.88889 (24) obj. 3651.67 iterations 3 Pass 20: suminf. 7.43750 (23) obj. 4344.06 iterations 43 No solution found this major pass Before mini branch and bound, 76 integers at bound fixed and 0 continuous Full problem 95 rows 138 columns, reduced to 90 rows 62 columns Mini branch and bound did not improve solution (0.05 seconds) Full problem 96 rows 138 columns, reduced to 96 rows 138 columns - too large After 0.06 seconds - Feasibility pump exiting - took 0.06 seconds 15 added rows had average density of 86.5333 At root node, 15 cuts changed objective from 1910 to 2254.04 in 100 passes Cut generator 0 (Probing) - 8 row cuts, 0 column cuts (4 active) in 1.488 seconds - new frequency is 4 Cut generator 1 (Gomory) - 2663 row cuts, 0 column cuts (11 active) in 0.068 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 81 row cuts, 0 column cuts (0 active) in 0.028 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) - 0 row cuts, 0 column cuts (0 active) in 0.104 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 184 row cuts, 0 column cuts (0 active) in 0.024 seconds - new frequency is -100 Optimal - objective value 2254.04 Optimal - objective value 2254.04 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 2254.04 (2.24 seconds) Search completed - best objective 3360, took 6579 iterations and 66 nodes (3.98 seconds) Strong branching done 1328 times (37810 iterations), fathomed 18 nodes and fixed 63 variables Maximum depth 28, 1605 variables fixed on reduced cost Cuts at root node changed objective from 1910 to 2254.04 Probing was tried 123 times and created 92 cuts of which 13 were active after adding rounds of cuts (1.532 seconds) Gomory was tried 193 times and created 3386 cuts of which 61 were active after adding rounds of cuts (0.100 seconds) Knapsack was tried 194 times and created 178 cuts of which 2 were active after adding rounds of cuts (0.040 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 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.104 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) TwoMirCuts was tried 100 times and created 184 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) implication was tried 94 times and created 3131 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 3360 after 66 nodes and 6579 iterations - took 4.07 seconds (total time 4.07) Total time 4.08 Solved to optimality. MIP solution: 3360 (66 nodes, 4.08 seconds) Best possible: 3360 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- misc03.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job misc03.gms Stop 08/24/08 03:25:02 elapsed 0:00:04.130