--- Job dsbmip Start 08/21/08 21:28:04 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 --- dsbmip.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dsbmip.gdx --- dsbmip.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.016 --- dsbmip.gms(123) 4 Mb --- Generating MIP model m --- dsbmip.gms(124) 4 Mb --- 1,183 rows 1,904 columns 8,461 non-zeroes --- 160 discrete-columns --- dsbmip.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.048 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 1903 columns and 1182 rows. 183 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 -306.769 - 0.09 seconds 13 fixed, 22 tightened bounds, 16 strengthened rows, 2 substitutions 1 fixed, 0 tightened bounds, 21 strengthened rows, 4 substitutions 0 fixed, 0 tightened bounds, 19 strengthened rows, 4 substitutions 0 fixed, 0 tightened bounds, 19 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 19 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 19 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 19 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 19 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 19 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 19 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 19 strengthened rows, 0 substitutions processed model has 1083 rows, 1748 columns (144 integer) and 7015 elements Pass 1: suminf. 1.43558 obj. 2824.9 iterations 1663 Pass 2: suminf. 0.00000 obj. 2977.35 iterations 115 Solution found of 2977.35 Before mini branch and bound, 91 integers at bound fixed and 1079 continuous Full problem 1083 rows 1748 columns, reduced to 317 rows 385 columns Mini branch and bound improved solution from 2977.35 to -225.395 (0.41 seconds) Freeing continuous variables gives a solution of -300.261 Round again with cutoff of -300.912 Pass 3: suminf. 3.20304 obj. -300.912 iterations 238 Pass 4: suminf. 0.00000 obj. -300.912 iterations 130 Pass 5: suminf. 0.00000 obj. -300.912 iterations 0 Pass 6: suminf. 0.15689 obj. -300.912 iterations 18 Pass 7: suminf. 0.03188 obj. -300.912 iterations 241 Pass 8: suminf. 0.00000 obj. -300.912 iterations 71 Solution found of -300.912 Before mini branch and bound, 85 integers at bound fixed and 1229 continuous Full problem 1083 rows 1748 columns, reduced to 187 rows 235 columns Mini branch and bound improved solution from -300.912 to -306.769 (0.62 seconds) After 0.63 seconds - Feasibility pump exiting with objective of -306.769 - took 0.62 seconds Integer solution of -306.769 found by feasibility pump after 0 iterations and 0 nodes (0.63 seconds) Full problem 1083 rows 1748 columns, reduced to 892 rows 1542 columns - too large Search completed - best objective -306.7690120304483, took 0 iterations and 0 nodes (0.67 seconds) Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -306.769 to -306.769 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) 185 bounds tightened after postprocessing Result - Finished objective -306.7690120304483 after 0 nodes and 0 iterations - took 0.91 seconds (total time 1.01) Total time 1.53 Solved to optimality. MIP solution: -306.769012 (0 nodes, 1.54 seconds) Best possible: -306.769012 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- dsbmip.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job dsbmip.gms Stop 08/21/08 21:28:06 elapsed 0:00:01.655