--- Job acc-tight-4 Start 08/21/08 16:55:20 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-4.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-4.gdx --- acc-tight-4.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.016 --- acc-tight-4.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-4.gms(124) 5 Mb --- 2,287 rows 1,621 columns 12,980 non-zeroes --- 1,620 discrete-columns --- acc-tight-4.gms(124) 5 Mb --- Executing COINCBC: elapsed 0:00:00.063 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 1620 columns and 2286 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.22 seconds processed model has 2286 rows, 1620 columns (1620 integer) and 12978 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 50.29110 obj. 0 iterations 2452 Pass 2: suminf. 35.79584 obj. 0 iterations 1289 Pass 3: suminf. 28.45934 obj. 0 iterations 1943 Pass 4: suminf. 24.10329 obj. 0 iterations 986 Pass 5: suminf. 13.91654 obj. 0 iterations 1255 Pass 6: suminf. 12.26667 obj. 0 iterations 1241 Pass 7: suminf. 14.00000 obj. 0 iterations 2653 Pass 8: suminf. 0.00000 obj. 0 iterations 710 Solution found of 0 Before mini branch and bound, 892 integers at bound fixed and 0 continuous Full problem 2286 rows 1620 columns, reduced to 1354 rows 696 columns - too large Mini branch and bound did not improve solution (3.26 seconds) After 3.26 seconds - Feasibility pump exiting with objective of 0 - took 3.26 seconds Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (3.33 seconds) Full problem 2286 rows 1620 columns, reduced to 0 rows 0 columns Search completed - best objective 0, took 0 iterations and 0 nodes (3.35 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 3.56 seconds (total time 3.78) Total time 3.82 Solved to optimality. MIP solution: 0 (0 nodes, 3.83 seconds) Best possible: 0 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- acc-tight-4.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job acc-tight-4.gms Stop 08/21/08 16:55:24 elapsed 0:00:03.950