--- Job khb05250 Start 08/21/08 22:03:28 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 --- khb05250.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/khb05250.gdx --- khb05250.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.008 --- khb05250.gms(123) 4 Mb --- Generating MIP model m --- khb05250.gms(124) 4 Mb --- 102 rows 1,351 columns 3,974 non-zeroes --- 24 discrete-columns --- khb05250.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.023 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 1350 columns and 101 rows. 24 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 9.59195e+07 - 0.01 seconds processed model has 99 rows, 1298 columns (24 integer) and 2619 elements Pass 1: suminf. 2.65360 obj. 1.13637e+08 iterations 21 Solution found of 1.42003e+08 Before mini branch and bound, 5 integers at bound fixed and 1217 continuous Full problem 99 rows 1298 columns, reduced to 23 rows 40 columns Mini branch and bound improved solution from 1.42003e+08 to 1.25402e+08 (0.01 seconds) Freeing continuous variables gives a solution of 1.24249e+08 Round again with cutoff of 1.21416e+08 Pass 2: suminf. 2.65360 obj. 1.02128e+08 iterations 13 Pass 3: suminf. 0.00000 obj. 1.21416e+08 iterations 22 Solution found of 1.21416e+08 Before mini branch and bound, 5 integers at bound fixed and 1224 continuous Full problem 99 rows 1298 columns, reduced to 18 rows 31 columns Mini branch and bound improved solution from 1.21416e+08 to 1.21278e+08 (0.03 seconds) Freeing continuous variables gives a solution of 1.20483e+08 After 0.03 seconds - Feasibility pump exiting with objective of 1.20483e+08 - took 0.03 seconds Integer solution of 1.20483e+08 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) Full problem 99 rows 1298 columns, reduced to 85 rows 1083 columns - too large 72 added rows had average density of 82.625 At root node, 72 cuts changed objective from 9.59195e+07 to 1.06921e+08 in 17 passes Cut generator 0 (Probing) - 59 row cuts (18 active), 0 column cuts in 0.016 seconds - new frequency is 1 Cut generator 1 (Gomory) - 25 row cuts (4 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 66 row cuts (28 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.120 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 37 row cuts (16 active), 0 column cuts in 0.012 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1.20483e+08 best solution, best possible 1.06921e+08 (0.33 seconds) Full problem 99 rows 1298 columns, reduced to 82 rows 1131 columns - too large Search completed - best objective 106940226, took 686 iterations and 18 nodes (0.65 seconds) Strong branching done 96 times (2125 iterations), fathomed 2 nodes and fixed 0 variables Maximum depth 7, 4 variables fixed on reduced cost Cuts at root node changed objective from 9.59195e+07 to 1.06921e+08 Probing was tried 28 times and created 67 cuts of which 23 were active after adding rounds of cuts (0.020 seconds) Gomory was tried 23 times and created 25 cuts of which 4 were active after adding rounds of cuts (0.016 seconds) Knapsack was tried 17 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) Clique was tried 17 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 28 times and created 69 cuts of which 30 were active after adding rounds of cuts (0.016 seconds) FlowCover was tried 17 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.120 seconds) TwoMirCuts was tried 17 times and created 37 cuts of which 16 were active after adding rounds of cuts (0.012 seconds) 1200 bounds tightened after postprocessing Result - Finished objective 106940226 after 18 nodes and 686 iterations - took 0.66 seconds (total time 0.67) Total time 0.69 Solved to optimality. MIP solution: 106940226 (18 nodes, 0.69 seconds) Best possible: 106940226 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- khb05250.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job khb05250.gms Stop 08/21/08 22:03:28 elapsed 0:00:00.749