--- Job dsbmip Start 08/21/08 07:01:43 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.045 --- 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.081 GAMS/CoinCbc 2.0 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.00.00, build Mar 20 2008 command line - GAMS/CBC -solve -quit Continuous objective value is -306.769 - 0.18 seconds 34 fixed, 119 tightened bounds, 32 strengthened rows, 6 substitutions 2 fixed, 10 tightened bounds, 38 strengthened rows, 10 substitutions 0 fixed, 0 tightened bounds, 34 strengthened rows, 4 substitutions 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 33 strengthened rows, 0 substitutions processed model has 1088 rows, 1751 columns (122 integer) and 6989 elements Pass 1: obj. 0.42471 --> up = 0 , down = 0 -- rand = 5 ( 29) Pass 2: obj. -0.00000 --> up = 0 , down = 0 -- rand = 0 ( 19) Pass 3: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 13) perturbation applied Pass 4: obj. 15.21429 --> up = 5 , down = 10 Pass 5: obj. 0.21429 --> up = 0 , down = 0 -- rand = 2 ( 16) Pass 6: obj. -0.00000 --> up = 0 , down = 0 -- rand = 0 ( 13) Pass 7: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 16) perturbation applied Pass 8: obj. 19.00000 --> up = 2 , down = 17 Pass 9: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 29) Pass 10: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 13) perturbation applied Pass 11: obj. 9.00000 --> up = 5 , down = 4 Pass 12: obj. -0.00000 --> up = 0 , down = 0 -- rand = 0 ( 25) Pass 13: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 11) perturbation applied Pass 14: obj. 25.00000 --> up = 4 , down = 21 Pass 15: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 11) Pass 16: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 13) perturbation applied Pass 17: obj. 19.00000 --> up = 3 , down = 16 Pass 18: obj. -0.00000 --> up = 0 , down = 0 -- rand = 0 ( 12) Pass 19: obj. 0.00000 --> up = 0 , down = 0 -- rand = 0 ( 23) perturbation applied Pass 20: obj. 21.00000 --> No solution found this major pass Before mini branch and bound, 56 integers at bound fixed and 1085 continuous Full problem 1088 rows 1751 columns, reduced to 311 rows 367 columns Mini branch and bound improved solution from 1.79769e+308 to -306.769 (0.27 seconds) Freeing continuous variables gives a solution of -306.769 After 0.28 seconds - Feasibility pump exiting - took 0.28 seconds Integer solution of -306.769 found by feasibility pump after 0 iterations and 0 nodes (0.28 seconds) Search completed - best objective -306.7690120304482, took 0 iterations and 0 nodes (0.28 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) Result - Finished objective -306.7690120304482 after 0 nodes and 0 iterations - took 0.64 seconds (total time 0.82) Total time 1.07 Solved to optimality. Writing solution. Objective: -306.769 Time: 1.08 s --- Restarting execution --- dsbmip.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job dsbmip.gms Stop 08/21/08 07:01:44 elapsed 0:00:01.212