--- Job misc03 Start 08/21/08 22:26:13 GAMS Rev 228 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 COINCBC: elapsed 0:00:00.013 GAMS/CoinCbc 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.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 1910 - 0.00 seconds 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 obj. 1910 iterations 2 Pass 2: suminf. 6.00000 obj. 1910 iterations 17 Pass 3: suminf. 7.66667 obj. 3682.5 iterations 32 Pass 4: suminf. 6.33333 obj. 3440 iterations 5 Pass 5: suminf. 5.66667 obj. 3638.33 iterations 16 Pass 6: suminf. 5.66667 obj. 3638.33 iterations 0 Pass 7: suminf. 5.75000 obj. 3811.25 iterations 13 Pass 8: suminf. 5.33333 obj. 3701.67 iterations 6 Pass 9: suminf. 6.50000 obj. 4045 iterations 40 Pass 10: suminf. 6.00000 obj. 3897.5 iterations 6 Pass 11: suminf. 6.00000 obj. 3897.5 iterations 17 Pass 12: suminf. 6.79167 obj. 5472.08 iterations 38 Pass 13: suminf. 5.90000 obj. 5285.85 iterations 19 Pass 14: suminf. 5.58000 obj. 5301.25 iterations 13 Pass 15: suminf. 5.43333 obj. 5203.17 iterations 7 Pass 16: suminf. 6.16667 obj. 5032.08 iterations 17 Pass 17: suminf. 5.66667 obj. 5156.25 iterations 4 Pass 18: suminf. 5.33333 obj. 5258.33 iterations 5 Pass 19: suminf. 5.33333 obj. 5258.33 iterations 0 Pass 20: suminf. 5.50000 obj. 5375.83 iterations 7 No solution found this major pass Before mini branch and bound, 62 integers at bound fixed and 0 continuous Full problem 95 rows 138 columns, reduced to 94 rows 76 columns Mini branch and bound improved solution from 1.79769e+308 to 3680 (0.10 seconds) Round again with cutoff of 3503 Pass 20: suminf. 6.00000 obj. 1910 iterations 10 Pass 21: suminf. 6.00000 obj. 1910 iterations 2 Pass 22: suminf. 6.00000 obj. 1910 iterations 8 Pass 23: suminf. 6.00000 obj. 1910 iterations 23 Pass 24: suminf. 6.00000 obj. 1910 iterations 17 Pass 25: suminf. 6.00000 obj. 1910 iterations 12 Pass 26: suminf. 6.00000 obj. 1910 iterations 9 Pass 27: suminf. 6.00000 obj. 1910 iterations 16 Pass 28: suminf. 6.00000 obj. 1910 iterations 7 Pass 29: suminf. 5.33333 obj. 2180.83 iterations 14 Pass 30: suminf. 4.66667 obj. 2716.67 iterations 15 Pass 31: suminf. 6.10256 obj. 3102.69 iterations 26 Pass 32: suminf. 5.33333 obj. 3105.83 iterations 10 Pass 33: suminf. 5.33333 obj. 3105.83 iterations 0 Pass 34: suminf. 5.00000 obj. 2790.5 iterations 19 Pass 35: suminf. 4.33333 obj. 2592.5 iterations 16 Pass 36: suminf. 5.44444 obj. 2445 iterations 19 Pass 37: suminf. 5.00000 obj. 2475 iterations 7 Pass 38: suminf. 6.00000 obj. 2672.5 iterations 14 Pass 39: suminf. 5.00000 obj. 2675 iterations 6 No solution found this major pass Before mini branch and bound, 92 integers at bound fixed and 0 continuous Full problem 95 rows 138 columns, reduced to 78 rows 40 columns Mini branch and bound did not improve solution (0.12 seconds) After 0.12 seconds - Feasibility pump exiting with objective of 3680 - took 0.12 seconds Integer solution of 3680 found by feasibility pump after 0 iterations and 0 nodes (0.12 seconds) Full problem 95 rows 138 columns, reduced to 0 rows 0 columns 11 added rows had average density of 63.3636 At root node, 11 cuts changed objective from 1910 to 2242.97 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 1.112 seconds - new frequency is 10 Cut generator 1 (Gomory) - 842 row cuts (11 active), 0 column cuts in 0.084 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 10 row cuts (0 active), 0 column cuts in 0.056 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.052 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 187 row cuts (0 active), 0 column cuts in 0.048 seconds - new frequency is -100 After 0 nodes, 1 on tree, 3680 best solution, best possible 2242.97 (1.88 seconds) Full problem 95 rows 138 columns, reduced to 17 rows 10 columns Full problem 95 rows 138 columns, reduced to 62 rows 20 columns Search completed - best objective 3360, took 6936 iterations and 78 nodes (3.10 seconds) Strong branching done 1218 times (27457 iterations), fathomed 23 nodes and fixed 106 variables Maximum depth 31, 1602 variables fixed on reduced cost Cuts at root node changed objective from 1910 to 2242.97 Probing was tried 106 times and created 21 cuts of which 3 were active after adding rounds of cuts (1.116 seconds) Gomory was tried 176 times and created 1277 cuts of which 58 were active after adding rounds of cuts (0.120 seconds) Knapsack was tried 100 times and created 10 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.052 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) TwoMirCuts was tried 100 times and created 187 cuts of which 0 were active after adding rounds of cuts (0.048 seconds) Result - Finished objective 3360 after 78 nodes and 6936 iterations - took 3.22 seconds (total time 3.22) Total time 3.22 Solved to optimality. MIP solution: 3360 (78 nodes, 3.22 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/21/08 22:26:16 elapsed 0:00:03.271