--- Job gesa3_o Start 08/24/08 02:14:46 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 --- gesa3_o.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gesa3_o.gdx --- gesa3_o.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.013 --- gesa3_o.gms(123) 4 Mb --- Generating MIP model m --- gesa3_o.gms(124) 4 Mb --- 1,225 rows 1,153 columns 4,417 non-zeroes --- 672 discrete-columns --- gesa3_o.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.154 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 1152 columns and 1224 rows. 672 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 2.78336e+07 - 0.02 seconds Optimal - objective value 2.78336e+07 0 fixed, 53 tightened bounds, 28 strengthened rows, 0 substitutions 0 fixed, 8 tightened bounds, 24 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions processed model has 1080 rows, 1008 columns (648 integer) and 3984 elements Pass 1: suminf. 16.60664 (81) obj. 2.8087e+07 iterations 39 Pass 2: suminf. 16.60664 (81) obj. 2.8087e+07 iterations 0 Pass 3: suminf. 16.60664 (81) obj. 2.8087e+07 iterations 0 Pass 4: suminf. 20.08028 (74) obj. 4.05874e+07 iterations 153 Pass 5: suminf. 18.93403 (70) obj. 4.06252e+07 iterations 30 Pass 6: suminf. 18.20442 (70) obj. 4.02671e+07 iterations 2 Pass 7: suminf. 18.20442 (70) obj. 4.02671e+07 iterations 0 Pass 8: suminf. 19.53211 (84) obj. 5.29534e+07 iterations 128 Pass 9: suminf. 18.76159 (83) obj. 5.28903e+07 iterations 19 Pass 10: suminf. 19.78845 (82) obj. 5.28453e+07 iterations 2 Pass 11: suminf. 19.78845 (82) obj. 5.28453e+07 iterations 0 Pass 12: suminf. 19.38248 (80) obj. 5.60493e+07 iterations 110 Pass 13: suminf. 18.87768 (76) obj. 5.59818e+07 iterations 19 Pass 14: suminf. 19.32010 (76) obj. 5.6236e+07 iterations 6 Pass 15: suminf. 19.32010 (76) obj. 5.6236e+07 iterations 0 Pass 16: suminf. 19.71187 (80) obj. 5.60978e+07 iterations 86 Pass 17: suminf. 20.05523 (80) obj. 5.56819e+07 iterations 17 Pass 18: suminf. 20.05523 (80) obj. 5.56819e+07 iterations 0 Pass 19: suminf. 20.05523 (80) obj. 5.56819e+07 iterations 0 Pass 20: suminf. 18.81116 (79) obj. 6.18997e+07 iterations 105 No solution found this major pass Before mini branch and bound, 284 integers at bound fixed and 152 continuous Full problem 1080 rows 1008 columns, reduced to 662 rows 544 columns - too large Mini branch and bound did not improve solution (0.11 seconds) After 0.11 seconds - Feasibility pump exiting - took 0.11 seconds 49 added rows had average density of 86.6735 At root node, 49 cuts changed objective from 2.78448e+07 to 2.79545e+07 in 100 passes Cut generator 0 (Probing) - 77 row cuts, 1 column cuts (5 active) in 1.328 seconds - new frequency is 1 Cut generator 1 (Gomory) - 5299 row cuts, 0 column cuts (44 active) in 0.792 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 21 row cuts, 0 column cuts (0 active) in 0.120 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 358 row cuts, 0 column cuts (0 active) in 0.128 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 55 row cuts, 0 column cuts (0 active) in 1.240 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 562 row cuts, 0 column cuts (0 active) in 0.328 seconds - new frequency is -100 Optimal - objective value 2.79545e+07 Optimal - objective value 2.79545e+07 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 2.79545e+07 (7.14 seconds) Integer solution of 2.80011e+07 found after 11931 iterations and 147 nodes (17.31 seconds) Integer solution of 2.80009e+07 found after 12073 iterations and 169 nodes (17.48 seconds) Full problem 1080 rows 1008 columns, reduced to 530 rows 325 columns Integer solution of 2.79914e+07 found by combine solutions after 12081 iterations and 172 nodes (17.69 seconds) Integer solution of 2.7991e+07 found after 12272 iterations and 207 nodes (17.84 seconds) Search completed - best objective 27991042.64838268, took 12369 iterations and 217 nodes (17.87 seconds) Strong branching done 3366 times (66582 iterations), fathomed 0 nodes and fixed 2 variables Maximum depth 20, 2232 variables fixed on reduced cost Cuts at root node changed objective from 2.78448e+07 to 2.79545e+07 Probing was tried 401 times and created 554 cuts of which 309 were active after adding rounds of cuts (1.780 seconds) Gomory was tried 330 times and created 7097 cuts of which 419 were active after adding rounds of cuts (1.332 seconds) Knapsack was tried 100 times and created 21 cuts of which 0 were active after adding rounds of cuts (0.120 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) MixedIntegerRounding2 was tried 348 times and created 2313 cuts of which 250 were active after adding rounds of cuts (0.404 seconds) FlowCover was tried 100 times and created 55 cuts of which 0 were active after adding rounds of cuts (1.240 seconds) TwoMirCuts was tried 100 times and created 562 cuts of which 0 were active after adding rounds of cuts (0.328 seconds) implication was tried 277 times and created 21235 cuts of which 0 were active after adding rounds of cuts 35 bounds tightened after postprocessing Result - Finished objective 27991042.64838268 after 217 nodes and 12369 iterations - took 18.03 seconds (total time 18.05) Total time 18.11 Solved to optimality. MIP solution: 27991042.65 (217 nodes, 18.12 seconds) Best possible: 27991042.65 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- gesa3_o.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gesa3_o.gms Stop 08/24/08 02:15:04 elapsed 0:00:18.470