--- Job lseu Start 08/21/08 22:03:40 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 --- 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.006 --- 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 COINCBC: elapsed 0:00:00.010 GAMS/CoinCbc 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.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 834.682 - 0.00 seconds 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 obj. 1030.18 iterations 14 Pass 2: suminf. 1.32732 obj. 1397.75 iterations 3 Pass 3: suminf. 0.45714 obj. 1400.8 iterations 2 Pass 4: suminf. 0.35238 obj. 1399.47 iterations 1 Pass 5: suminf. 0.56184 obj. 3552.5 iterations 22 Pass 6: suminf. 0.13684 obj. 3699.55 iterations 4 Pass 7: suminf. 0.36000 obj. 3543.48 iterations 2 Pass 8: suminf. 0.21905 obj. 3544.47 iterations 1 Pass 9: suminf. 1.12452 obj. 3300.06 iterations 17 Pass 10: suminf. 0.43097 obj. 3132.93 iterations 5 Pass 11: suminf. 0.57399 obj. 3153.53 iterations 2 Pass 12: suminf. 0.46135 obj. 3135.06 iterations 1 Pass 13: suminf. 0.52897 obj. 3920.31 iterations 17 Pass 14: suminf. 0.06897 obj. 3920.31 iterations 5 Pass 15: suminf. 0.71373 obj. 3950.5 iterations 3 Pass 16: suminf. 0.20230 obj. 3747.38 iterations 3 Pass 17: suminf. 0.06897 obj. 3748.31 iterations 1 Pass 18: suminf. 0.28571 obj. 3896 iterations 2 Pass 19: suminf. 0.23048 obj. 3895.61 iterations 1 Pass 20: suminf. 0.53793 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 improved solution from 1.79769e+308 to 1542 (0.05 seconds) Round again with cutoff of 1482.28 Pass 20: suminf. 0.69474 obj. 1030.18 iterations 15 Pass 21: suminf. 0.45714 obj. 1400.8 iterations 5 Pass 22: suminf. 0.45714 obj. 1400.8 iterations 0 Pass 23: suminf. 0.35238 obj. 1399.47 iterations 1 Pass 24: suminf. 3.76773 obj. 1482.28 iterations 27 Pass 25: suminf. 1.06589 obj. 1482.28 iterations 19 Pass 26: suminf. 1.16113 obj. 1482.28 iterations 8 Pass 27: suminf. 1.04707 obj. 1482.28 iterations 6 Pass 28: suminf. 1.12241 obj. 1315.87 iterations 8 Pass 29: suminf. 0.76250 obj. 1405.15 iterations 3 Pass 30: suminf. 0.83959 obj. 1482.28 iterations 3 Pass 31: suminf. 0.36291 obj. 1482.28 iterations 2 Pass 32: suminf. 0.73019 obj. 1482.28 iterations 6 Pass 33: suminf. 1.22944 obj. 1482.28 iterations 13 Pass 34: suminf. 0.28452 obj. 1385.48 iterations 7 Pass 35: suminf. 0.75860 obj. 1482.28 iterations 3 Pass 36: suminf. 1.03782 obj. 1482.28 iterations 12 Pass 37: suminf. 0.76512 obj. 1482.28 iterations 8 Pass 38: suminf. 0.76068 obj. 1482.28 iterations 3 Pass 39: suminf. 0.21552 obj. 1482.28 iterations 3 No solution found this major pass Before mini branch and bound, 49 integers at bound fixed and 0 continuous Full problem 28 rows 88 columns, reduced to 19 rows 38 columns Mini branch and bound improved solution from 1542 to 1165 (0.10 seconds) After 0.10 seconds - Feasibility pump exiting with objective of 1165 - took 0.10 seconds Integer solution of 1165 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) Full problem 28 rows 88 columns, reduced to 5 rows 10 columns 14 added rows had average density of 57.7857 At root node, 14 cuts changed objective from 944.754 to 1057.53 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.896 seconds - new frequency is 10 Cut generator 1 (Gomory) - 411 row cuts (11 active), 0 column cuts in 0.064 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 139 row cuts (2 active), 0 column cuts in 0.032 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 179 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 302 row cuts (1 active), 0 column cuts in 0.040 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1165 best solution, best possible 1057.53 (1.23 seconds) Full problem 28 rows 88 columns, reduced to 14 rows 16 columns Strong branching is fixing too many variables, too expensively! Integer solution of 1120 found after 1821 iterations and 42 nodes (1.47 seconds) Full problem 28 rows 88 columns, reduced to 16 rows 23 columns Search completed - best objective 1120, took 2729 iterations and 88 nodes (1.81 seconds) Strong branching done 1840 times (9752 iterations), fathomed 12 nodes and fixed 91 variables Maximum depth 13, 848 variables fixed on reduced cost Cuts at root node changed objective from 944.754 to 1057.53 Probing was tried 108 times and created 9 cuts of which 1 were active after adding rounds of cuts (0.896 seconds) Gomory was tried 182 times and created 818 cuts of which 77 were active after adding rounds of cuts (0.080 seconds) Knapsack was tried 182 times and created 552 cuts of which 47 were active after adding rounds of cuts (0.044 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 182 times and created 379 cuts of which 72 were active after adding rounds of cuts (0.028 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 302 cuts of which 1 were active after adding rounds of cuts (0.040 seconds) Result - Finished objective 1120 after 88 nodes and 2729 iterations - took 1.85 seconds (total time 1.85) Total time 1.85 Solved to optimality. MIP solution: 1120 (88 nodes, 1.85 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/21/08 22:03:42 elapsed 0:00:01.890