--- Job egout Start 08/21/08 21:28:06 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 --- egout.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/egout.gdx --- egout.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- egout.gms(123) 4 Mb --- Generating MIP model m --- egout.gms(124) 4 Mb --- 99 rows 142 columns 393 non-zeroes --- 55 discrete-columns --- Executing COINCBC: elapsed 0:00:00.009 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 141 columns and 98 rows. 55 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 149.589 - -0.00 seconds 15 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 15 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 40 rows, 48 columns (28 integer) and 105 elements Pass 1: suminf. 1.43597 obj. 514.46 iterations 10 Solution found of 634.422 Before mini branch and bound, 19 integers at bound fixed and 12 continuous Full problem 40 rows 48 columns, reduced to 2 rows 3 columns Mini branch and bound improved solution from 634.422 to 625.319 (0.00 seconds) Round again with cutoff of 613.946 Pass 2: suminf. 1.43597 obj. 514.46 iterations 8 Pass 3: suminf. 0.31588 obj. 613.946 iterations 10 Pass 4: suminf. 0.04593 obj. 605.866 iterations 1 Pass 5: suminf. 0.43177 obj. 568.805 iterations 6 Pass 6: suminf. 0.83419 obj. 613.946 iterations 5 Pass 7: suminf. 0.04593 obj. 611.846 iterations 2 Pass 8: suminf. 0.11608 obj. 613.946 iterations 1 Pass 9: suminf. 1.09587 obj. 613.946 iterations 12 Pass 10: suminf. 0.75396 obj. 613.946 iterations 2 Pass 11: suminf. 0.39058 obj. 613.946 iterations 1 Pass 12: suminf. 0.47280 obj. 613.946 iterations 5 Pass 13: suminf. 0.46371 obj. 613.946 iterations 1 Pass 14: suminf. 0.53228 obj. 613.946 iterations 3 Pass 15: suminf. 0.76309 obj. 613.946 iterations 1 Pass 16: suminf. 0.54748 obj. 613.946 iterations 7 Pass 17: suminf. 0.54748 obj. 613.946 iterations 0 Pass 18: suminf. 0.41445 obj. 613.946 iterations 4 Pass 19: suminf. 0.03879 obj. 613.946 iterations 2 Pass 20: suminf. 0.19870 obj. 592.306 iterations 1 Pass 21: suminf. 0.26093 obj. 595.651 iterations 9 Before mini branch and bound, 9 integers at bound fixed and 5 continuous Full problem 40 rows 48 columns, reduced to 21 rows 28 columns Mini branch and bound improved solution from 625.319 to 594.765 (0.02 seconds) After 0.02 seconds - Feasibility pump exiting with objective of 594.765 - took 0.02 seconds Integer solution of 594.765 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) Full problem 40 rows 48 columns, reduced to 0 rows 0 columns Integer solution of 586.315 found by combine solutions after 0 iterations and 0 nodes (0.02 seconds) 14 added rows had average density of 4.85714 At root node, 14 cuts changed objective from 511.585 to 568.101 in 5 passes Cut generator 0 (Probing) - 44 row cuts (6 active), 0 column cuts in 0.000 seconds - new frequency is 1 Cut generator 1 (Gomory) - 18 row cuts (2 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 6 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 13 row cuts (2 active), 0 column cuts in 0.000 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 8 row cuts (1 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 24 row cuts (3 active), 0 column cuts in 0.000 seconds - new frequency is -100 Integer solution of 568.101 found after 39 iterations and 0 nodes (0.02 seconds) Search completed - best objective 568.1007, took 39 iterations and 0 nodes (0.02 seconds) Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 511.585 to 568.101 Probing was tried 5 times and created 44 cuts of which 6 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 5 times and created 18 cuts of which 2 were active after adding rounds of cuts (0.004 seconds) Knapsack was tried 5 times and created 6 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 5 times and created 13 cuts of which 2 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 5 times and created 8 cuts of which 1 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 5 times and created 24 cuts of which 3 were active after adding rounds of cuts (0.000 seconds) 20 bounds tightened after postprocessing Result - Finished objective 568.1007 after 0 nodes and 39 iterations - took 0.04 seconds (total time 0.04) Total time 0.04 Solved to optimality. MIP solution: 568.1007 (0 nodes, 0.04 seconds) Best possible: 568.1007 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- egout.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job egout.gms Stop 08/21/08 21:28:06 elapsed 0:00:00.067