--- Job ran12x21 Start 07/18/08 15:10:57 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 --- ran12x21.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran12x21.gdx --- ran12x21.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.007 --- ran12x21.gms(123) 4 Mb --- Generating MIP model m --- ran12x21.gms(124) 4 Mb --- 286 rows 505 columns 1,513 non-zeroes --- 252 discrete-columns --- Executing Cbc: elapsed 0:00:00.016 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: 504 columns and 285 rows. 252 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 3157.38 - 0.01 seconds processed model has 285 rows, 504 columns (252 integer) and 1008 elements Pass 1: suminf. 2.23721 obj. 3297.4 iterations 69 Solution found of 4511 Before mini branch and bound, 228 integers at bound fixed and 227 continuous Full problem 285 rows 504 columns, reduced to 29 rows 35 columns Mini branch and bound improved solution from 4511 to 4033 (0.02 seconds) Round again with cutoff of 3945.44 Pass 2: suminf. 2.23721 obj. 3304.56 iterations 59 Pass 3: suminf. 0.47637 obj. 3945.44 iterations 68 Pass 4: suminf. 0.28725 obj. 3906.86 iterations 17 Pass 5: suminf. 3.73674 obj. 3945.44 iterations 127 Pass 6: suminf. 1.14284 obj. 3945.44 iterations 87 Pass 7: suminf. 1.60550 obj. 3945.44 iterations 74 Pass 8: suminf. 1.09992 obj. 3945.44 iterations 50 Pass 9: suminf. 1.70686 obj. 3945.44 iterations 52 Pass 10: suminf. 1.62104 obj. 3945.44 iterations 35 Pass 11: suminf. 1.45524 obj. 3945.44 iterations 62 Pass 12: suminf. 1.28464 obj. 3945.44 iterations 41 Pass 13: suminf. 1.80075 obj. 3945.44 iterations 59 Pass 14: suminf. 1.01888 obj. 3945.44 iterations 36 Pass 15: suminf. 1.55308 obj. 3945.44 iterations 63 Pass 16: suminf. 0.78031 obj. 3945.44 iterations 55 Pass 17: suminf. 0.86688 obj. 3945.44 iterations 45 Pass 18: suminf. 0.68864 obj. 3945.44 iterations 39 Pass 19: suminf. 1.04551 obj. 3945.44 iterations 39 Pass 20: suminf. 1.04551 obj. 3945.44 iterations 26 Pass 21: suminf. 1.39937 obj. 3945.44 iterations 57 Before mini branch and bound, 200 integers at bound fixed and 200 continuous Full problem 285 rows 504 columns, reduced to 72 rows 98 columns Mini branch and bound did not improve solution (0.17 seconds) After 0.17 seconds - Feasibility pump exiting with objective of 11 - took 0.17 seconds Integer solution of 4511 found by feasibility pump after 0 iterations and 0 nodes (0.17 seconds) Full problem 285 rows 504 columns, reduced to 0 rows 0 columns 43 added rows had average density of 23.5349 At root node, 43 cuts changed objective from 3157.38 to 3434.57 in 20 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.044 seconds - new frequency is 10 Cut generator 1 (Gomory) - 3 row cuts (0 active), 0 column cuts in 0.040 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 89 row cuts (10 active), 0 column cuts in 0.048 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 136 row cuts (24 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 70 row cuts (8 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 62 row cuts (1 active), 0 column cuts in 0.068 seconds - new frequency is -100 After 0 nodes, 1 on tree, 4511 best solution, best possible 3434.57 (0.83 seconds) Cbc0004I Integer solution of 4488 found after 11171 iterations and 258 nodes (7.94 seconds) Cbc0038I Full problem 285 rows 504 columns, reduced to 53 rows 68 columns Cbc0038I Full problem 285 rows 504 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 4177 found by combine solutions after 11197 iterations and 259 nodes (8.28 seconds) Cbc0038I Full problem 285 rows 504 columns, reduced to 0 rows 0 columns Cbc0004I Integer solution of 4146 found after 25719 iterations and 863 nodes (10.84 seconds) Cbc0038I Full problem 285 rows 504 columns, reduced to 68 rows 92 columns Cbc0038I Full problem 285 rows 504 columns, reduced to 0 rows 0 columns Cbc0004I Integer solution of 4038 found after 25793 iterations and 867 nodes (10.89 seconds) Cbc0038I Full problem 285 rows 504 columns, reduced to 43 rows 54 columns Cbc0012I Integer solution of 3872 found by combine solutions after 25838 iterations and 868 nodes (11.03 seconds) Cbc0012I Integer solution of 4136 found by combine solutions after 25766 iterations and 864 nodes (11.26 seconds) Cbc0004I Integer solution of 3835 found after 33477 iterations and 1292 nodes (12.56 seconds) Cbc0038I Full problem 285 rows 504 columns, reduced to 87 rows 122 columns Cbc0004I Integer solution of 3664 found after 462278 iterations and 17548 nodes (82.87 seconds) Cbc0038I Full problem 285 rows 504 columns, reduced to 87 rows 122 columns Cbc0038I Full problem 285 rows 504 columns, reduced to 66 rows 87 columns Solved to optimality. wallclocktime: 121.857 used seconds: 231.21 MIP solution: 3664 (77608 nodes, 231.21 seconds) Best possible: 3664 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran12x21.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran12x21.gms Stop 07/18/08 15:12:59 elapsed 0:02:01.899