--- Job irp Start 08/24/08 02:45:33 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 --- 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.127 --- 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 Cbc: elapsed 0:00:00.429 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 12123.5 - 0.11 seconds Optimal - objective value 12123.5 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. 3.19608 (22) obj. 12181.5 iterations 72 Pass 2: suminf. 1.86207 (15) obj. 12198.4 iterations 66 Pass 3: suminf. 1.86207 (15) obj. 12198.4 iterations 0 Pass 4: suminf. 4.60000 (29) obj. 12341.9 iterations 97 Pass 5: suminf. 2.00000 (9) obj. 12248.3 iterations 83 Pass 6: suminf. 0.00000 (0) obj. 12253 iterations 3 Solution found of 12253 Before mini branch and bound, 19293 integers at bound fixed and 0 continuous Full problem 39 rows 19370 columns, reduced to 37 rows 77 columns Mini branch and bound did not improve solution (0.49 seconds) Round again with cutoff of 12240.1 Reduced cost fixing fixed 1443 variables on major pass 2 Pass 7: suminf. 3.40000 (13) obj. 12175.8 iterations 77 Pass 8: suminf. 3.12121 (15) obj. 12193.9 iterations 66 Pass 9: suminf. 1.45455 (10) obj. 12195.4 iterations 19 Pass 10: suminf. 1.45455 (10) obj. 12195.4 iterations 1 Pass 11: suminf. 1.40000 (5) obj. 12168.9 iterations 22 Pass 12: suminf. 1.25000 (5) obj. 12186.4 iterations 45 Pass 13: suminf. 1.25000 (5) obj. 12186.4 iterations 0 Pass 14: suminf. 3.99584 (18) obj. 12240.1 iterations 120 Pass 15: suminf. 1.22333 (11) obj. 12240.1 iterations 112 Pass 16: suminf. 1.59892 (14) obj. 12240.1 iterations 56 Pass 17: suminf. 3.74960 (22) obj. 12240.1 iterations 76 Pass 18: suminf. 2.91695 (17) obj. 12240.1 iterations 92 Pass 19: suminf. 2.22768 (21) obj. 12240.1 iterations 40 Pass 20: suminf. 0.00000 (0) obj. 12237.6 iterations 74 Solution found of 12237.6 Before mini branch and bound, 19244 integers at bound fixed and 0 continuous Full problem 39 rows 19370 columns, reduced to 34 rows 123 columns Mini branch and bound did not improve solution (1.49 seconds) After 1.49 seconds - Feasibility pump exiting with objective of 12237.6 - took 1.45 seconds Integer solution of 12237.6 found by feasibility pump after 0 iterations and 0 nodes (1.50 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 (2.25 seconds) 25 added rows had average density of 273.04 At root node, 25 cuts changed objective from 12123.5 to 12157.4 in 10 passes Cut generator 0 (Probing) - 12 row cuts, 0 column cuts (2 active) in 0.140 seconds - new frequency is 1 Cut generator 1 (Gomory) - 150 row cuts, 0 column cuts (22 active) in 0.160 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 Cut generator 3 (Clique) - 516 row cuts, 0 column cuts (1 active) in 0.024 seconds - new frequency is 1 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.052 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts, 0 column cuts (0 active) in 0.204 seconds - new frequency is -100 Optimal - objective value 12157.6 Optimal - objective value 12157.6 After 0 nodes, 1 on tree, 12210.2 best solution, best possible 12157.6 (22.89 seconds) Full problem 39 rows 19370 columns, reduced to 15 rows 23 columns Integer solution of 12184.7 found by combine solutions after 1463 iterations and 13 nodes (35.37 seconds) Integer solution of 12184.2 found after 2024 iterations and 33 nodes (36.57 seconds) Full problem 39 rows 19370 columns, reduced to 22 rows 29 columns Integer solution of 12178.5 found by combine solutions after 2043 iterations and 35 nodes (36.74 seconds) Integer solution of 12178 found after 2164 iterations and 42 nodes (37.12 seconds) Full problem 39 rows 19370 columns, reduced to 22 rows 33 columns Integer solution of 12172.4 found by combine solutions after 2171 iterations and 43 nodes (37.28 seconds) Full problem 39 rows 19370 columns, reduced to 16 rows 39 columns Search completed - best objective 12159.492836, took 3579 iterations and 93 nodes (40.08 seconds) Strong branching done 1970 times (53565 iterations), fathomed 4 nodes and fixed 55 variables Maximum depth 17, 107537 variables fixed on reduced cost Cuts at root node changed objective from 12123.5 to 12157.6 Probing was tried 120 times and created 28 cuts of which 9 were active after adding rounds of cuts (0.676 seconds) Gomory was tried 68 times and created 170 cuts of which 26 were active after adding rounds of cuts (0.380 seconds) Knapsack was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) Clique was tried 68 times and created 1472 cuts of which 115 were active after adding rounds of cuts (0.144 seconds) MixedIntegerRounding2 was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.052 seconds) FlowCover was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) TwoMirCuts was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.204 seconds) implication was tried 94 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 12159.492836 after 93 nodes and 3579 iterations - took 40.35 seconds (total time 40.47) Total time 40.57 Solved to optimality. MIP solution: 12159.49284 (93 nodes, 40.6 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/24/08 02:46:15 elapsed 0:00:41.618