--- Job acc-tight-1 Start 08/21/08 16:01:38 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 --- acc-tight-1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-1.gdx --- acc-tight-1.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.018 --- acc-tight-1.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-1.gms(124) 5 Mb --- 2,521 rows 1,621 columns 15,329 non-zeroes --- 1,620 discrete-columns --- acc-tight-1.gms(124) 5 Mb --- Executing COINCBC: elapsed 0:00:00.070 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 1620 columns and 2520 rows. 1620 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 0 - 0.28 seconds processed model has 2520 rows, 1620 columns (1620 integer) and 15327 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 53.65616 obj. 0.281743 iterations 2062 Pass 2: suminf. 39.47898 obj. 0.0640342 iterations 1293 Pass 3: suminf. 36.31484 obj. 0.0929707 iterations 830 Pass 4: suminf. 35.08309 obj. 0.0197915 iterations 533 Pass 5: suminf. 33.65498 obj. 0 iterations 387 Pass 6: suminf. 32.80244 obj. 0 iterations 243 Pass 7: suminf. 30.25340 obj. 0.0523658 iterations 630 Pass 8: suminf. 29.38269 obj. 0.0636331 iterations 547 Pass 9: suminf. 26.22165 obj. 0.177103 iterations 537 Pass 10: suminf. 24.54131 obj. 0.163597 iterations 516 Pass 11: suminf. 22.57266 obj. 0.322374 iterations 1036 Pass 12: suminf. 22.47560 obj. 0.344555 iterations 423 Pass 13: suminf. 19.23147 obj. 0.380294 iterations 1771 Pass 14: suminf. 16.30769 obj. 0.692308 iterations 1386 Pass 15: suminf. 15.22388 obj. 0.880597 iterations 2549 Pass 16: suminf. 0.00000 obj. 1 iterations 1969 Solution found of 1 Before mini branch and bound, 661 integers at bound fixed and 0 continuous Full problem 2520 rows 1620 columns, reduced to 1833 rows 953 columns - too large Mini branch and bound did not improve solution (5.21 seconds) Round again with cutoff of 0.9 Reduced cost fixing fixed 1 variables on major pass 2 Pass 17: suminf. 55.86320 obj. 0 iterations 2098 Pass 18: suminf. 42.85655 obj. 0 iterations 1144 Pass 19: suminf. 38.98071 obj. 0 iterations 617 Pass 20: suminf. 36.88462 obj. 0 iterations 834 Pass 21: suminf. 34.33563 obj. 0 iterations 656 Pass 22: suminf. 30.37857 obj. 0 iterations 1175 Pass 23: suminf. 29.65666 obj. 0 iterations 403 Pass 24: suminf. 28.16758 obj. 0 iterations 1023 Pass 25: suminf. 22.18027 obj. 0 iterations 1772 Pass 26: suminf. 18.07459 obj. 0 iterations 1025 Pass 27: suminf. 16.64311 obj. 0 iterations 975 Pass 28: suminf. 0.00000 obj. 0 iterations 1251 Solution found of 0 Before mini branch and bound, 656 integers at bound fixed and 0 continuous Full problem 2520 rows 1620 columns, reduced to 1909 rows 960 columns - too large Mini branch and bound did not improve solution (8.84 seconds) After 8.84 seconds - Feasibility pump exiting with objective of 0 - took 8.83 seconds Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (8.91 seconds) Full problem 2520 rows 1620 columns, reduced to 0 rows 0 columns Search completed - best objective 0, took 0 iterations and 0 nodes (8.94 seconds) Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Finished objective 0 after 0 nodes and 0 iterations - took 9.18 seconds (total time 9.46) Total time 9.52 Solved to optimality. MIP solution: 0 (0 nodes, 9.52 seconds) Best possible: 0 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- acc-tight-1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job acc-tight-1.gms Stop 08/21/08 16:01:48 elapsed 0:00:09.665