--- Job dsbmip Start 07/17/08 18:28:42 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 --- 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.051 --- 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 Cbc: elapsed 0:00:00.087 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" 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 Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is -306.769 - 0.11 seconds 13 fixed, 22 tightened bounds, 15 strengthened rows, 2 substitutions 1 fixed, 0 tightened bounds, 20 strengthened rows, 2 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, 1707 columns (144 integer) and 6974 elements Pass 1: suminf. 1.43558 obj. 3660.75 iterations 1385 Pass 2: suminf. 0.00000 obj. 3475.99 iterations 152 Solution found of 3475.99 Before mini branch and bound, 93 integers at bound fixed and 1078 continuous Full problem 1083 rows 1707 columns, reduced to 311 rows 349 columns Mini branch and bound improved solution from 3475.99 to -202.856 (0.45 seconds) Freeing continuous variables gives a solution of -306.769 After 0.47 seconds - Feasibility pump exiting with objective of -306.769 - took 0.47 seconds Integer solution of -306.769 found by feasibility pump after 0 iterations and 0 nodes (0.47 seconds) Full problem 1083 rows 1707 columns, reduced to 891 rows 1501 columns - too large Thread 0 used 0 times, waiting to start 0.000396143, 0 cpu time, 0 locks, 0 locked, 0 waiting for locks Thread 1 used 0 times, waiting to start 0.000236104, 0 cpu time, 0 locks, 0 locked, 0 waiting for locks Main thread 0 waiting for threads, 1 locks, 5.02903e-06 locked, 1.72574e-06 waiting for locks Search completed - best objective -306.7690120304488, took 0 iterations and 0 nodes (0.52 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) 182 bounds tightened after postprocessing Result - Finished objective -306.7690120304498 after 0 nodes and 0 iterations - took 0.78 seconds (total time 0.89) Total time 1.34 Solved to optimality. wallclocktime: 1.38336 used seconds: 1.34 MIP solution: -306.769012 (0 nodes, 1.34 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 07/17/08 18:28:44 elapsed 0:00:01.511