--- Job gesa3_o Start 08/21/08 21:59:24 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 --- 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.012 --- 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 COINCBC: elapsed 0:00:00.035 GAMS/CoinCbc 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.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 2.78336e+07 - 0.02 seconds 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 obj. 2.8087e+07 iterations 39 Pass 2: suminf. 16.60664 obj. 2.8087e+07 iterations 0 Pass 3: suminf. 16.60664 obj. 2.8087e+07 iterations 0 Pass 4: suminf. 20.08028 obj. 4.05874e+07 iterations 150 Pass 5: suminf. 18.93403 obj. 4.06252e+07 iterations 30 Pass 6: suminf. 18.20442 obj. 4.02671e+07 iterations 2 Pass 7: suminf. 18.20442 obj. 4.02671e+07 iterations 0 Pass 8: suminf. 19.47471 obj. 5.29552e+07 iterations 129 Pass 9: suminf. 18.70419 obj. 5.28921e+07 iterations 19 Pass 10: suminf. 19.73105 obj. 5.28471e+07 iterations 2 Pass 11: suminf. 19.73105 obj. 5.28471e+07 iterations 0 Pass 12: suminf. 19.30632 obj. 5.60793e+07 iterations 111 Pass 13: suminf. 18.80153 obj. 5.60118e+07 iterations 19 Pass 14: suminf. 19.24395 obj. 5.6266e+07 iterations 6 Pass 15: suminf. 19.24395 obj. 5.6266e+07 iterations 0 Pass 16: suminf. 19.69371 obj. 5.6126e+07 iterations 86 Pass 17: suminf. 20.03708 obj. 5.571e+07 iterations 17 Pass 18: suminf. 20.03708 obj. 5.571e+07 iterations 0 Pass 19: suminf. 20.03708 obj. 5.571e+07 iterations 0 Pass 20: suminf. 18.38683 obj. 6.18434e+07 iterations 104 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 51 added rows had average density of 95.8039 At root node, 51 cuts changed objective from 2.78448e+07 to 2.79431e+07 in 83 passes Cut generator 0 (Probing) - 46 row cuts (1 active), 1 column cuts in 1.564 seconds - new frequency is 1 Cut generator 1 (Gomory) - 234 row cuts (11 active), 0 column cuts in 0.560 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 9 row cuts (0 active), 0 column cuts in 0.196 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) - 158 row cuts (7 active), 0 column cuts in 0.140 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 43 row cuts (0 active), 0 column cuts in 0.552 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 492 row cuts (30 active), 0 column cuts in 0.236 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 2.79431e+07 (5.44 seconds) Integer solution of 2.80124e+07 found after 6115 iterations and 157 nodes (12.22 seconds) Full problem 1080 rows 1008 columns, reduced to 542 rows 333 columns Integer solution of 2.7991e+07 found by combine solutions after 6116 iterations and 159 nodes (14.32 seconds) Search completed - best objective 27991042.64838268, took 6756 iterations and 229 nodes (15.31 seconds) Strong branching done 2410 times (43041 iterations), fathomed 6 nodes and fixed 17 variables Maximum depth 18, 2020 variables fixed on reduced cost Cuts at root node changed objective from 2.78448e+07 to 2.79431e+07 Probing was tried 278 times and created 116 cuts of which 38 were active after adding rounds of cuts (1.776 seconds) Gomory was tried 203 times and created 352 cuts of which 58 were active after adding rounds of cuts (0.792 seconds) Knapsack was tried 83 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.196 seconds) Clique was tried 83 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 83 times and created 158 cuts of which 7 were active after adding rounds of cuts (0.140 seconds) FlowCover was tried 83 times and created 43 cuts of which 0 were active after adding rounds of cuts (0.552 seconds) TwoMirCuts was tried 83 times and created 492 cuts of which 30 were active after adding rounds of cuts (0.236 seconds) 35 bounds tightened after postprocessing Result - Finished objective 27991042.64838268 after 229 nodes and 6756 iterations - took 15.47 seconds (total time 15.49) Total time 15.54 Solved to optimality. MIP solution: 27991042.65 (229 nodes, 15.55 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/21/08 21:59:39 elapsed 0:00:15.700