--- Job neos1 Start 07/18/08 13:15:59 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 --- neos1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/neos1.gdx --- neos1.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.089 --- neos1.gms(123) 4 Mb --- Generating MIP model m --- neos1.gms(124) 6 Mb --- 5,021 rows 2,113 columns 21,601 non-zeroes --- 2,112 discrete-columns --- neos1.gms(124) 6 Mb --- Executing Cbc: elapsed 0:00:00.258 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: 2112 columns and 5020 rows. 2112 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 5.6 - 0.08 seconds processed model has 1018 rows, 1728 columns (1728 integer) and 8208 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 5.60000 obj. 5.6 iterations 110 Pass 2: suminf. 1.20000 obj. 23 iterations 58 Pass 3: suminf. 1.20000 obj. 23 iterations 3 Pass 4: suminf. 1.20000 obj. 23 iterations 8 Pass 5: suminf. 42.95000 obj. 55.0833 iterations 432 Pass 6: suminf. 6.93333 obj. 52.0667 iterations 169 Pass 7: suminf. 6.60000 obj. 52.0667 iterations 35 Pass 8: suminf. 4.20000 obj. 58.2 iterations 15 Pass 9: suminf. 4.20000 obj. 58.2 iterations 0 Pass 10: suminf. 1.20000 obj. 67 iterations 24 Pass 11: suminf. 1.20000 obj. 67 iterations 6 Pass 12: suminf. 38.46667 obj. 80.9 iterations 315 Pass 13: suminf. 5.20000 obj. 78.4 iterations 159 Pass 14: suminf. 4.20000 obj. 78.4 iterations 19 Pass 15: suminf. 1.60000 obj. 84 iterations 19 Pass 16: suminf. 1.60000 obj. 84 iterations 4 Pass 17: suminf. 39.50000 obj. 91.7333 iterations 282 Pass 18: suminf. 6.93333 obj. 90 iterations 169 Pass 19: suminf. 5.93333 obj. 90 iterations 18 Pass 20: suminf. 3.40000 obj. 93.2 iterations 13 No solution found this major pass Before mini branch and bound, 1292 integers at bound fixed and 0 continuous Full problem 1018 rows 1728 columns, reduced to 394 rows 364 columns Mini branch and bound improved solution from 1.79769e+308 to 23 (0.94 seconds) Round again with cutoff of 21.26 Pass 20: suminf. 5.60000 obj. 5.6 iterations 110 Pass 21: suminf. 1.80000 obj. 20.6 iterations 54 Pass 22: suminf. 1.80000 obj. 20.6 iterations 2 Pass 23: suminf. 1.74000 obj. 21.26 iterations 9 Pass 24: suminf. 1.74000 obj. 21.26 iterations 0 Pass 25: suminf. 1.74000 obj. 21.26 iterations 9 Pass 26: suminf. 1.74000 obj. 21.26 iterations 0 Pass 27: suminf. 1.74000 obj. 21.26 iterations 8 Pass 28: suminf. 39.27667 obj. 21.26 iterations 425 Pass 29: suminf. 9.40000 obj. 17 iterations 273 Pass 30: suminf. 9.26667 obj. 17.2 iterations 30 Pass 31: suminf. 8.14000 obj. 21.26 iterations 21 Pass 32: suminf. 8.14000 obj. 21.26 iterations 3 Pass 33: suminf. 8.14000 obj. 21.26 iterations 13 Pass 34: suminf. 8.14000 obj. 21.26 iterations 19 Pass 35: suminf. 8.14000 obj. 21.26 iterations 7 Pass 36: suminf. 39.52667 obj. 21.26 iterations 292 Pass 37: suminf. 12.33333 obj. 18 iterations 168 Pass 38: suminf. 12.33333 obj. 18 iterations 21 Pass 39: suminf. 9.72667 obj. 21.26 iterations 25 No solution found this major pass Before mini branch and bound, 1423 integers at bound fixed and 0 continuous Mini branch and bound did not improve solution (1.28 seconds) After 1.28 seconds - Feasibility pump exiting with objective of 23 - took 1.27 seconds Integer solution of 23 found by feasibility pump after 0 iterations and 0 nodes (1.28 seconds) Full problem 1018 rows 1728 columns, reduced to 0 rows 0 columns 399 added rows had average density of 13.9123 At root node, 399 cuts changed objective from 5.6 to 17.8995 in 31 passes Cut generator 0 (Probing) - 3621 row cuts (230 active), 0 column cuts in 2.340 seconds - new frequency is 1 Cut generator 1 (Gomory) - 1905 row cuts (9 active), 0 column cuts in 1.004 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 3304 row cuts (139 active), 0 column cuts in 0.324 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 438 row cuts (14 active), 0 column cuts in 0.116 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.068 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 514 row cuts (7 active), 0 column cuts in 0.248 seconds - new frequency is -100 After 0 nodes, 1 on tree, 23 best solution, best possible 17.8995 (11.97 seconds) Cbc0038I Full problem 1018 rows 1728 columns, reduced to 44 rows 57 columns Cbc0038I Full problem 1018 rows 1728 columns, reduced to 0 rows 0 columns Solved to optimality. wallclocktime: 27.6626 used seconds: 40.83 MIP solution: 19 (71 nodes, 40.83 seconds) Best possible: 19 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- neos1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job neos1.gms Stop 07/18/08 13:16:27 elapsed 0:00:27.998