--- Job gesa3 Start 08/24/08 02:14:36 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 --- gesa3.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/gesa3.gdx --- gesa3.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.015 --- gesa3.gms(123) 4 Mb --- Generating MIP model m --- gesa3.gms(124) 4 Mb --- 1,369 rows 1,153 columns 5,737 non-zeroes --- 384 discrete-columns --- gesa3.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.044 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 1152 columns and 1368 rows. 384 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 2.78336e+07 - 0.02 seconds Optimal - objective value 2.78336e+07 0 fixed, 25 tightened bounds, 59 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 23 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 11 strengthened rows, 0 substitutions processed model has 1296 rows, 1080 columns (384 integer) and 4776 elements Pass 1: suminf. 13.76380 (69) obj. 2.78709e+07 iterations 42 Pass 2: suminf. 13.76380 (69) obj. 2.78709e+07 iterations 0 Pass 3: suminf. 13.76380 (69) obj. 2.78709e+07 iterations 0 Pass 4: suminf. 14.67127 (67) obj. 3.70962e+07 iterations 189 Pass 5: suminf. 13.90624 (65) obj. 3.73426e+07 iterations 14 Pass 6: suminf. 12.77641 (63) obj. 3.74483e+07 iterations 8 Solution found of 3.74483e+07 Branch and bound needed to clear up 63 general integers Mini branch and bound could not fix general integers No solution found this major pass Before mini branch and bound, 233 integers at bound fixed and 432 continuous Full problem 1296 rows 1080 columns, reduced to 595 rows 407 columns Mini branch and bound did not improve solution (0.49 seconds) After 0.49 seconds - Feasibility pump exiting - took 0.49 seconds 50 added rows had average density of 123.58 At root node, 50 cuts changed objective from 2.78464e+07 to 2.79659e+07 in 75 passes Cut generator 0 (Probing) - 94 row cuts, 0 column cuts (11 active) in 1.184 seconds - new frequency is 1 Cut generator 1 (Gomory) - 3481 row cuts, 0 column cuts (39 active) in 0.468 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.088 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 129 row cuts, 0 column cuts (0 active) in 0.124 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 2 row cuts, 0 column cuts (0 active) in 0.548 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 559 row cuts, 0 column cuts (0 active) in 0.220 seconds - new frequency is -100 Optimal - objective value 2.79659e+07 Optimal - objective value 2.79659e+07 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 2.79659e+07 (6.30 seconds) Integer solution of 2.7991e+07 found after 8348 iterations and 159 nodes (8.80 seconds) Search completed - best objective 27991042.64838269, took 8889 iterations and 214 nodes (9.06 seconds) Strong branching done 334 times (10070 iterations), fathomed 1 nodes and fixed 0 variables Maximum depth 21, 1383 variables fixed on reduced cost Cuts at root node changed objective from 2.78464e+07 to 2.79659e+07 Probing was tried 338 times and created 363 cuts of which 138 were active after adding rounds of cuts (1.640 seconds) Gomory was tried 265 times and created 4616 cuts of which 224 were active after adding rounds of cuts (0.752 seconds) Knapsack was tried 75 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.088 seconds) Clique was tried 75 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) MixedIntegerRounding2 was tried 75 times and created 129 cuts of which 0 were active after adding rounds of cuts (0.124 seconds) FlowCover was tried 75 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.548 seconds) TwoMirCuts was tried 75 times and created 559 cuts of which 0 were active after adding rounds of cuts (0.220 seconds) implication was tried 250 times and created 6904 cuts of which 0 were active after adding rounds of cuts 19 bounds tightened after postprocessing Result - Finished objective 27991042.64838269 after 214 nodes and 8889 iterations - took 9.26 seconds (total time 9.29) Total time 9.36 Solved to optimality. MIP solution: 27991042.65 (214 nodes, 9.37 seconds) Best possible: 27991042.65 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- gesa3.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gesa3.gms Stop 08/24/08 02:14:46 elapsed 0:00:09.529