--- Job misc07 Start 08/21/08 22:26:18 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 --- misc07.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/misc07.gdx --- misc07.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.008 --- misc07.gms(123) 4 Mb --- Generating MIP model m --- misc07.gms(124) 4 Mb --- 213 rows 261 columns 8,621 non-zeroes --- 259 discrete-columns --- misc07.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.025 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 260 columns and 212 rows. 259 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 1415 - 0.01 seconds 21 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 21 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 211 rows, 232 columns (232 integer) and 8260 elements Objective coefficients multiple of 5 Cutoff increment increased from 1e-05 to 4.995 Pass 1: suminf. 8.00000 obj. 1415 iterations 0 Pass 2: suminf. 8.00000 obj. 1415 iterations 35 Pass 3: suminf. 10.03810 obj. 2779.76 iterations 88 Pass 4: suminf. 6.28042 obj. 3056.9 iterations 89 Pass 5: suminf. 5.32143 obj. 3131.43 iterations 28 Pass 6: suminf. 8.60000 obj. 2625.75 iterations 41 Pass 7: suminf. 5.78571 obj. 3508.75 iterations 22 Pass 8: suminf. 4.81250 obj. 3591.25 iterations 20 Pass 9: suminf. 7.00000 obj. 2779.17 iterations 25 Pass 10: suminf. 7.00000 obj. 2779.17 iterations 3 Pass 11: suminf. 6.37500 obj. 3335.1 iterations 30 Pass 12: suminf. 4.00000 obj. 3331.88 iterations 27 Pass 13: suminf. 4.00000 obj. 3411.25 iterations 16 Pass 14: suminf. 3.00000 obj. 3857.5 iterations 25 Pass 15: suminf. 3.00000 obj. 3857.5 iterations 4 Pass 16: suminf. 9.55357 obj. 4273.93 iterations 65 Pass 17: suminf. 7.00000 obj. 4315 iterations 24 Pass 18: suminf. 7.00000 obj. 4315 iterations 19 Pass 19: suminf. 8.50000 obj. 3750 iterations 55 Pass 20: suminf. 6.33333 obj. 3650 iterations 18 No solution found this major pass Before mini branch and bound, 92 integers at bound fixed and 0 continuous Full problem 211 rows 232 columns, reduced to 211 rows 140 columns - too large Mini branch and bound did not improve solution (0.13 seconds) Full problem 212 rows 232 columns, reduced to 212 rows 232 columns - too large After 0.26 seconds - Feasibility pump exiting - took 0.26 seconds 10 added rows had average density of 191.6 At root node, 10 cuts changed objective from 1415 to 1479.69 in 100 passes Cut generator 0 (Probing) - 4 row cuts (1 active), 0 column cuts in 3.288 seconds - new frequency is 8 Cut generator 1 (Gomory) - 1902 row cuts (9 active), 0 column cuts in 0.200 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 2 row cuts (0 active), 0 column cuts in 0.072 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.296 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.032 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 288 row cuts (0 active), 0 column cuts in 0.104 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 1479.69 (5.09 seconds) Full problem 211 rows 232 columns, reduced to 0 rows 0 columns Full problem 211 rows 232 columns, reduced to 12 rows 10 columns Full problem 211 rows 232 columns, reduced to 55 rows 24 columns Full problem 211 rows 232 columns, reduced to 82 rows 33 columns Full problem 211 rows 232 columns, reduced to 86 rows 43 columns Strong branching is fixing too many variables, too expensively! After 1000 nodes, 296 on tree, 2810 best solution, best possible 2005.71 (33.76 seconds) After 2000 nodes, 524 on tree, 2810 best solution, best possible 2172 (46.48 seconds) After 3000 nodes, 768 on tree, 2810 best solution, best possible 2248.75 (53.58 seconds) After 4000 nodes, 993 on tree, 2810 best solution, best possible 2313 (58.26 seconds) After 5000 nodes, 1157 on tree, 2810 best solution, best possible 2367.86 (61.91 seconds) After 6000 nodes, 1289 on tree, 2810 best solution, best possible 2405.83 (64.82 seconds) After 7000 nodes, 1413 on tree, 2810 best solution, best possible 2438.33 (67.35 seconds) After 8000 nodes, 1512 on tree, 2810 best solution, best possible 2466.25 (69.85 seconds) After 9000 nodes, 1593 on tree, 2810 best solution, best possible 2494.46 (72.15 seconds) After 10000 nodes, 1658 on tree, 2810 best solution, best possible 2520 (74.39 seconds) After 11000 nodes, 1702 on tree, 2810 best solution, best possible 2544.38 (76.38 seconds) After 12000 nodes, 1736 on tree, 2810 best solution, best possible 2565 (78.28 seconds) After 13000 nodes, 1730 on tree, 2810 best solution, best possible 2586.25 (80.14 seconds) After 14000 nodes, 1590 on tree, 2810 best solution, best possible 2586.25 (81.45 seconds) After 15000 nodes, 1597 on tree, 2810 best solution, best possible 2614.29 (83.22 seconds) After 16000 nodes, 1552 on tree, 2810 best solution, best possible 2636.25 (84.80 seconds) After 17000 nodes, 1514 on tree, 2810 best solution, best possible 2658 (86.39 seconds) After 18000 nodes, 1281 on tree, 2810 best solution, best possible 2658 (87.44 seconds) After 19000 nodes, 1217 on tree, 2810 best solution, best possible 2682.14 (88.93 seconds) After 20000 nodes, 1147 on tree, 2810 best solution, best possible 2703.33 (90.29 seconds) After 21000 nodes, 1030 on tree, 2810 best solution, best possible 2723.75 (91.54 seconds) After 22000 nodes, 721 on tree, 2810 best solution, best possible 2723.75 (92.42 seconds) After 23000 nodes, 592 on tree, 2810 best solution, best possible 2747.68 (93.60 seconds) After 24000 nodes, 420 on tree, 2810 best solution, best possible 2769.33 (94.67 seconds) After 25000 nodes, 144 on tree, 2810 best solution, best possible 2795 (95.59 seconds) Search completed - best objective 2810, took 264901 iterations and 25362 nodes (95.88 seconds) Strong branching done 31548 times (671136 iterations), fathomed 667 nodes and fixed 4307 variables Maximum depth 113, 183103 variables fixed on reduced cost Cuts at root node changed objective from 1415 to 1479.69 Probing was tried 1147 times and created 1486 cuts of which 446 were active after adding rounds of cuts (4.316 seconds) Gomory was tried 3119 times and created 25768 cuts of which 2088 were active after adding rounds of cuts (2.052 seconds) Knapsack was tried 100 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.072 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) MixedIntegerRounding2 was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.296 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) TwoMirCuts was tried 100 times and created 288 cuts of which 0 were active after adding rounds of cuts (0.104 seconds) Result - Finished objective 2810 after 25362 nodes and 264901 iterations - took 96.77 seconds (total time 96.79) Total time 96.79 Solved to optimality. MIP solution: 2810 (25362 nodes, 96.8 seconds) Best possible: 2810 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- misc07.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job misc07.gms Stop 08/21/08 22:27:55 elapsed 0:01:36.944