--- Job irp Start 08/21/08 22:02:44 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 --- irp.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/irp.gdx --- irp.gms(148) 7 Mb --- Starting execution: elapsed 0:00:00.087 --- irp.gms(123) 7 Mb --- Generating MIP model m --- irp.gms(124) 13 Mb --- 40 rows 20,316 columns 118,570 non-zeroes --- 20,315 discrete-columns --- irp.gms(124) 13 Mb --- Executing COINCBC: elapsed 0:00:00.363 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 20315 columns and 39 rows. 20315 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 12123.5 - 0.12 seconds 0 fixed, 23 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 39 rows, 19370 columns (19370 integer) and 93161 elements Pass 1: suminf. 4.14583 obj. 12178.5 iterations 55 Pass 2: suminf. 3.33333 obj. 12309.5 iterations 10 Pass 3: suminf. 3.33333 obj. 12309.5 iterations 52 Pass 4: suminf. 7.19298 obj. 12312 iterations 134 Pass 5: suminf. 4.55000 obj. 12226.6 iterations 39 Pass 6: suminf. 3.80000 obj. 12221 iterations 16 Pass 7: suminf. 3.80000 obj. 12221 iterations 59 Pass 8: suminf. 6.50000 obj. 12300.5 iterations 133 Pass 9: suminf. 3.60000 obj. 12265.7 iterations 91 Pass 10: suminf. 3.60000 obj. 12265.7 iterations 75 Pass 11: suminf. 6.29697 obj. 12471.8 iterations 138 Pass 12: suminf. 2.00000 obj. 12328 iterations 76 Pass 13: suminf. 2.00000 obj. 12328 iterations 5 Pass 14: suminf. 2.00000 obj. 12328 iterations 23 Pass 15: suminf. 2.72727 obj. 12505.7 iterations 198 Pass 16: suminf. 1.66667 obj. 12584.9 iterations 86 Pass 17: suminf. 1.33333 obj. 12668 iterations 119 Pass 18: suminf. 1.33333 obj. 12668 iterations 37 Pass 19: suminf. 2.00000 obj. 12674.7 iterations 237 Pass 20: suminf. 0.00000 obj. 12660.5 iterations 43 Before mini branch and bound, 19217 integers at bound fixed and 0 continuous Full problem 39 rows 19370 columns, reduced to 39 rows 153 columns Mini branch and bound improved solution from 1.79769e+308 to 12320.1 (2.03 seconds) Round again with cutoff of 12300.4 Reduced cost fixing fixed 894 variables on major pass 2 Pass 20: suminf. 3.50000 obj. 12151.3 iterations 64 Pass 21: suminf. 3.50000 obj. 12149.4 iterations 105 Pass 22: suminf. 6.34921 obj. 12296.5 iterations 151 Pass 23: suminf. 3.40000 obj. 12275.5 iterations 51 Pass 24: suminf. 3.40000 obj. 12275.5 iterations 14 Pass 25: suminf. 3.40000 obj. 12275.3 iterations 36 Pass 26: suminf. 3.93443 obj. 12242.7 iterations 75 Pass 27: suminf. 2.00000 obj. 12250.7 iterations 73 Pass 28: suminf. 2.00000 obj. 12250.7 iterations 63 Pass 29: suminf. 0.00000 obj. 12249.3 iterations 37 Solution found of 12249.3 Before mini branch and bound, 19281 integers at bound fixed and 0 continuous Full problem 39 rows 19370 columns, reduced to 36 rows 88 columns Mini branch and bound did not improve solution (3.00 seconds) After 3.00 seconds - Feasibility pump exiting with objective of 1 - took 2.96 seconds Integer solution of 12660.5 found by feasibility pump after 0 iterations and 0 nodes (3.01 seconds) Full problem 39 rows 19370 columns, reduced to 0 rows 0 columns Full problem 39 rows 19370 columns, reduced to 16 rows 1784 columns Integer solution of 12210.2 found by greedy equality after 0 iterations and 0 nodes (3.66 seconds) Full problem 39 rows 19370 columns, reduced to 0 rows 0 columns 31 added rows had average density of 41.3871 At root node, 31 cuts changed objective from 12123.5 to 12130.7 in 20 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.120 seconds - new frequency is 10 Cut generator 1 (Gomory) - 1 row cuts (1 active), 0 column cuts in 0.240 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.072 seconds - new frequency is -100 Cut generator 3 (Clique) - 1213 row cuts (30 active), 0 column cuts in 0.056 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.076 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.064 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.216 seconds - new frequency is -100 After 0 nodes, 1 on tree, 12210.2 best solution, best possible 12130.7 (9.49 seconds) Full problem 39 rows 19370 columns, reduced to 18 rows 26 columns Integer solution of 12184.7 found by combine solutions after 1352 iterations and 9 nodes (16.64 seconds) Full problem 39 rows 19370 columns, reduced to 16 rows 34 columns Integer solution of 12173 found by combine solutions after 1623 iterations and 19 nodes (18.61 seconds) Full problem 39 rows 19370 columns, reduced to 19 rows 39 columns Integer solution of 12172.1 found by combine solutions after 2178 iterations and 34 nodes (21.70 seconds) Full problem 39 rows 19370 columns, reduced to 22 rows 44 columns Integer solution of 12160.3 found by combine solutions after 3533 iterations and 97 nodes (26.03 seconds) After 100 nodes, 8 on tree, 12160.3 best solution, best possible 12131.6 (27.04 seconds) Strong branching is fixing too many variables, too expensively! After 200 nodes, 20 on tree, 12160.3 best solution, best possible 12140.6 (38.09 seconds) Full problem 39 rows 19370 columns, reduced to 22 rows 46 columns Integer solution of 12159.5 found by combine solutions after 6529 iterations and 262 nodes (40.53 seconds) After 300 nodes, 7 on tree, 12159.5 best solution, best possible 12158.5 (41.77 seconds) Search completed - best objective 12159.492836, took 7112 iterations and 338 nodes (42.24 seconds) Strong branching done 4406 times (73651 iterations), fathomed 28 nodes and fixed 853 variables Maximum depth 46, 232091 variables fixed on reduced cost Cuts at root node changed objective from 12123.5 to 12130.7 Probing was tried 42 times and created 1 cuts of which 1 were active after adding rounds of cuts (0.216 seconds) Gomory was tried 20 times and created 1 cuts of which 1 were active after adding rounds of cuts (0.240 seconds) Knapsack was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.072 seconds) Clique was tried 81 times and created 2653 cuts of which 180 were active after adding rounds of cuts (0.176 seconds) MixedIntegerRounding2 was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.076 seconds) FlowCover was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.064 seconds) TwoMirCuts was tried 20 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.216 seconds) Result - Finished objective 12159.492836 after 338 nodes and 7112 iterations - took 42.75 seconds (total time 42.86) Total time 42.95 Solved to optimality. MIP solution: 12159.49284 (338 nodes, 42.95 seconds) Best possible: 12159.49284 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- irp.gms(124) 0 Mb --- Reading solution for model m --- irp.gms(124) 8 Mb *** Status: Normal completion --- Job irp.gms Stop 08/21/08 22:03:28 elapsed 0:00:43.968