--- Job mod011 Start 07/17/08 21:59:49 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 --- mod011.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod011.gdx --- mod011.gms(148) 5 Mb --- Starting execution: elapsed 0:00:00.074 --- mod011.gms(123) 5 Mb --- Generating MIP model m --- mod011.gms(124) 7 Mb --- 4,481 rows 10,968 columns 29,849 non-zeroes --- 96 discrete-columns --- mod011.gms(124) 7 Mb --- Executing Cbc: elapsed 0:00:00.216 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: 10967 columns and 4480 rows. 96 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 -6.2122e+07 - 0.27 seconds 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions processed model has 1435 rows, 6766 columns (96 integer) and 14655 elements Pass 1: suminf. 0.00000 obj. 0 iterations 4027 Solution found of 0 Before mini branch and bound, 80 integers at bound fixed and 4920 continuous Full problem 1435 rows 6766 columns, reduced to 65 rows 816 columns Mini branch and bound improved solution from 0 to -4.27748e+07 (0.46 seconds) Freeing continuous variables gives a solution of -4.27767e+07 Round again with cutoff of -4.47073e+07 Pass 2: suminf. 2.07058 obj. -4.47073e+07 iterations 975 Pass 3: suminf. 0.99860 obj. -4.47073e+07 iterations 525 Pass 4: suminf. 0.73536 obj. -4.47073e+07 iterations 82 Pass 5: suminf. 0.00000 obj. -4.47073e+07 iterations 498 Solution found of -4.47073e+07 Before mini branch and bound, 80 integers at bound fixed and 4744 continuous Full problem 1435 rows 6766 columns, reduced to 383 rows 1349 columns Mini branch and bound improved solution from -4.47073e+07 to -5.00402e+07 (0.92 seconds) Freeing continuous variables gives a solution of -5.27967e+07 After 0.94 seconds - Feasibility pump exiting with objective of -5.27967e+07 - took 0.93 seconds Integer solution of -5.27967e+07 found by feasibility pump after 0 iterations and 0 nodes (0.94 seconds) Full problem 1435 rows 6766 columns, reduced to 891 rows 3517 columns Integer solution of -5.35182e+07 found by combine solutions after 0 iterations and 0 nodes (1.30 seconds) 254 added rows had average density of 29.7008 At root node, 254 cuts changed objective from -6.2082e+07 to -5.71176e+07 in 20 passes Cut generator 0 (Probing) - 1294 row cuts (234 active), 0 column cuts in 0.080 seconds - new frequency is 1 Cut generator 1 (Gomory) - 22 row cuts (9 active), 0 column cuts in 0.120 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.100 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 114 row cuts (2 active), 0 column cuts in 0.024 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 9 row cuts (1 active), 0 column cuts in 0.328 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 104 row cuts (8 active), 0 column cuts in 0.096 seconds - new frequency is -100 After 0 nodes, 1 on tree, -5.35182e+07 best solution, best possible -5.71176e+07 (4.06 seconds) After 100 nodes, 34 on tree, -5.35182e+07 best solution, best possible -5.66828e+07 (33.89 seconds) After 200 nodes, 29 on tree, -5.35182e+07 best solution, best possible -5.66828e+07 (39.71 seconds) Cbc0004I Integer solution of -5.36784e+07 found after 35144 iterations and 248 nodes (41.64 seconds) Cbc0038I Full problem 1435 rows 6766 columns, reduced to 891 rows 3517 columns Cbc0038I Full problem 1435 rows 6766 columns, reduced to 936 rows 4263 columns - too large Cbc0004I Integer solution of -5.39591e+07 found after 56313 iterations and 401 nodes (51.00 seconds) Cbc0038I Full problem 1435 rows 6766 columns, reduced to 914 rows 3564 columns Cbc0038I Full problem 1435 rows 6766 columns, reduced to 936 rows 4263 columns - too large Cbc0004I Integer solution of -5.4108e+07 found after 59574 iterations and 434 nodes (52.98 seconds) Cbc0038I Full problem 1435 rows 6766 columns, reduced to 927 rows 3594 columns Cbc0038I Full problem 1435 rows 6766 columns, reduced to 936 rows 4263 columns - too large Cbc0004I Integer solution of -5.43534e+07 found after 146384 iterations and 1132 nodes (78.05 seconds) Cbc0038I Full problem 1435 rows 6766 columns, reduced to 943 rows 3629 columns Cbc0038I Full problem 1435 rows 6766 columns, reduced to 936 rows 4263 columns - too large Cbc0004I Integer solution of -5.45585e+07 found after 152568 iterations and 1180 nodes (81.05 seconds) Cbc0038I Full problem 1435 rows 6766 columns, reduced to 943 rows 3629 columns Cbc0038I Full problem 1435 rows 6766 columns, reduced to 949 rows 4293 columns - too large Solved to optimality. wallclocktime: 89.467 used seconds: 171.9 MIP solution: -54558535.01 (4015 nodes, 171.9 seconds) Best possible: -54558535.01 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- mod011.gms(124) 0 Mb --- Reading solution for model m --- mod011.gms(124) 5 Mb *** Status: Normal completion --- Job mod011.gms Stop 07/17/08 22:01:19 elapsed 0:01:29.759