--- Job prod1 Start 07/18/08 15:04:13 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 --- prod1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/prod1.gdx --- prod1.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.009 --- prod1.gms(123) 4 Mb --- Generating MIP model m --- prod1.gms(124) 4 Mb --- 209 rows 251 columns 5,352 non-zeroes --- 149 discrete-columns --- Executing Cbc: elapsed 0:00:00.024 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: 250 columns and 208 rows. 149 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 -100 - 0.01 seconds 0 fixed, 0 tightened bounds, 0 strengthened rows, 100 substitutions processed model has 107 rows, 149 columns (149 integer) and 5049 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 12.81070 obj. -86.1161 iterations 18 Pass 2: suminf. 11.84728 obj. -85.1527 iterations 2 Pass 3: suminf. 3.67817 obj. -71.3218 iterations 25 Pass 4: suminf. 0.37926 obj. -56.6207 iterations 20 Pass 5: suminf. 0.00093 obj. -48.9991 iterations 13 Pass 6: suminf. 0.00093 obj. -48.9991 iterations 0 Pass 7: suminf. 3.38598 obj. -46.3518 iterations 35 Pass 8: suminf. 2.07764 obj. -45.9224 iterations 9 Solution found of -36 Before mini branch and bound, 71 integers at bound fixed and 0 continuous Full problem 107 rows 149 columns, reduced to 76 rows 71 columns Mini branch and bound improved solution from -36 to -50 (0.13 seconds) Round again with cutoff of -53.6808 Pass 9: suminf. 12.81070 obj. -86.1161 iterations 18 Pass 10: suminf. 11.84728 obj. -85.1527 iterations 2 Pass 11: suminf. 6.40191 obj. -77.5981 iterations 15 Pass 12: suminf. 2.59200 obj. -68.408 iterations 15 Pass 13: suminf. 0.55309 obj. -58.4469 iterations 15 Pass 14: suminf. 0.31918 obj. -53.6808 iterations 10 Pass 15: suminf. 0.27287 obj. -53.7271 iterations 4 Pass 16: suminf. 4.32010 obj. -53.6808 iterations 44 Pass 17: suminf. 3.56029 obj. -53.6808 iterations 2 Pass 18: suminf. 2.97904 obj. -53.6808 iterations 5 Pass 19: suminf. 2.97904 obj. -53.6808 iterations 1 Pass 20: suminf. 3.09148 obj. -53.6808 iterations 5 Pass 21: suminf. 2.65426 obj. -53.6808 iterations 7 Pass 22: suminf. 3.09148 obj. -53.6808 iterations 5 Pass 23: suminf. 4.86724 obj. -53.6808 iterations 41 Pass 24: suminf. 4.20231 obj. -53.6808 iterations 7 Pass 25: suminf. 3.92088 obj. -53.6808 iterations 6 Pass 26: suminf. 3.92088 obj. -53.6808 iterations 3 Pass 27: suminf. 4.19731 obj. -53.6808 iterations 4 Pass 28: suminf. 4.19731 obj. -53.6808 iterations 5 No solution found this major pass Before mini branch and bound, 58 integers at bound fixed and 0 continuous Full problem 107 rows 149 columns, reduced to 100 rows 89 columns Mini branch and bound did not improve solution (0.41 seconds) After 0.41 seconds - Feasibility pump exiting with objective of -50 - took 0.40 seconds Integer solution of -50 found by feasibility pump after 0 iterations and 0 nodes (0.41 seconds) Full problem 107 rows 149 columns, reduced to 0 rows 0 columns 67 added rows had average density of 51.7313 At root node, 67 cuts changed objective from -86.8082 to -83.1248 in 100 passes Cut generator 0 (Probing) - 74 row cuts (47 active), 0 column cuts in 10.725 seconds - new frequency is 1 Cut generator 1 (Gomory) - 3 row cuts (3 active), 0 column cuts in 0.320 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 827 row cuts (3 active), 0 column cuts in 0.348 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 65 row cuts (0 active), 0 column cuts in 0.720 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.036 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 627 row cuts (13 active), 0 column cuts in 0.176 seconds - new frequency is -100 After 0 nodes, 1 on tree, -50 best solution, best possible -83.1248 (13.72 seconds) Cbc0004I Integer solution of -52 found after 4551 iterations and 109 nodes (17.03 seconds) Cbc0038I Full problem 107 rows 149 columns, reduced to 0 rows 0 columns Cbc0038I Full problem 107 rows 149 columns, reduced to 19 rows 23 columns Cbc0012I Integer solution of -53 found by combine solutions after 4584 iterations and 114 nodes (17.20 seconds) Cbc0038I Full problem 107 rows 149 columns, reduced to 0 rows 0 columns Cbc0038I Full problem 107 rows 149 columns, reduced to 23 rows 28 columns Cbc0004I Integer solution of -56 found after 43204 iterations and 2053 nodes (39.43 seconds) Cbc0038I Full problem 107 rows 149 columns, reduced to 23 rows 28 columns Cbc0038I Full problem 107 rows 149 columns, reduced to 41 rows 49 columns Solved to optimality. wallclocktime: 104.61 used seconds: 190.14 MIP solution: -56 (28868 nodes, 190.14 seconds) Best possible: -56 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- prod1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job prod1.gms Stop 07/18/08 15:05:58 elapsed 0:01:44.662