--- Job lseu Start 08/24/08 02:46:22 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 --- lseu.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/lseu.gdx --- lseu.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.004 --- lseu.gms(123) 4 Mb --- Generating MIP model m --- lseu.gms(124) 4 Mb --- 29 rows 90 columns 395 non-zeroes --- 89 discrete-columns --- Executing Cbc: elapsed 0:00:00.008 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 89 columns and 28 rows. 89 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 834.682 - -0.00 seconds Optimal - objective value 834.682 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions processed model has 28 rows, 88 columns (88 integer) and 308 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 0.69474 (3) obj. 1030.18 iterations 16 Pass 2: suminf. 1.32732 (3) obj. 1397.75 iterations 3 Pass 3: suminf. 0.45714 (1) obj. 1400.8 iterations 2 Pass 4: suminf. 0.35238 (1) obj. 1399.47 iterations 1 Pass 5: suminf. 0.56184 (2) obj. 3552.5 iterations 22 Pass 6: suminf. 0.13684 (1) obj. 3699.55 iterations 4 Pass 7: suminf. 0.36000 (1) obj. 3543.48 iterations 2 Pass 8: suminf. 0.21905 (1) obj. 3544.47 iterations 1 Pass 9: suminf. 1.12452 (4) obj. 3300.06 iterations 16 Pass 10: suminf. 0.43097 (2) obj. 3132.93 iterations 5 Pass 11: suminf. 0.57399 (2) obj. 3153.53 iterations 2 Pass 12: suminf. 0.46135 (2) obj. 3135.06 iterations 1 Pass 13: suminf. 0.52897 (3) obj. 3920.31 iterations 18 Pass 14: suminf. 0.06897 (1) obj. 3920.31 iterations 5 Pass 15: suminf. 0.71373 (2) obj. 3950.5 iterations 3 Pass 16: suminf. 0.20230 (2) obj. 3747.38 iterations 3 Pass 17: suminf. 0.06897 (1) obj. 3748.31 iterations 1 Pass 18: suminf. 0.28571 (1) obj. 3896 iterations 2 Pass 19: suminf. 0.23048 (1) obj. 3895.61 iterations 1 Pass 20: suminf. 0.53793 (3) obj. 4478.4 iterations 20 No solution found this major pass Before mini branch and bound, 41 integers at bound fixed and 0 continuous Full problem 28 rows 88 columns, reduced to 20 rows 47 columns Mini branch and bound did not improve solution (0.05 seconds) After 0.05 seconds - Feasibility pump exiting - took 0.05 seconds 10 added rows had average density of 66.6 At root node, 10 cuts changed objective from 944.754 to 1045.75 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.752 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 1753 row cuts, 0 column cuts (8 active) in 0.036 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 223 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 212 row cuts, 0 column cuts (2 active) in 0.016 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 372 row cuts, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 Optimal - objective value 1045.75 Optimal - objective value 1045.75 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 1045.75 (1.02 seconds) Full problem 28 rows 88 columns, reduced to 15 rows 21 columns Strong branching is fixing too many variables, too expensively! Full problem 28 rows 88 columns, reduced to 16 rows 23 columns Integer solution of 1120 found after 3053 iterations and 70 nodes (1.51 seconds) Full problem 28 rows 88 columns, reduced to 17 rows 26 columns Search completed - best objective 1120, took 3605 iterations and 92 nodes (1.59 seconds) Strong branching done 2212 times (13323 iterations), fathomed 8 nodes and fixed 36 variables Maximum depth 13, 656 variables fixed on reduced cost Cuts at root node changed objective from 944.754 to 1045.75 Probing was tried 203 times and created 85 cuts of which 8 were active after adding rounds of cuts (0.792 seconds) Gomory was tried 259 times and created 2777 cuts of which 120 were active after adding rounds of cuts (0.072 seconds) Knapsack was tried 259 times and created 979 cuts of which 140 were active after adding rounds of cuts (0.028 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 259 times and created 595 cuts of which 44 were active after adding rounds of cuts (0.036 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) TwoMirCuts was tried 100 times and created 372 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) implication was tried 159 times and created 0 cuts of which 0 were active after adding rounds of cuts Result - Finished objective 1120 after 92 nodes and 3605 iterations - took 1.61 seconds (total time 1.61) Total time 1.61 Solved to optimality. MIP solution: 1120 (92 nodes, 1.62 seconds) Best possible: 1120 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- lseu.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job lseu.gms Stop 08/24/08 02:46:23 elapsed 0:00:01.693