--- Job ran10x10c Start 07/18/08 15:09:41 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 --- ran10x10c.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10c.gdx --- ran10x10c.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- ran10x10c.gms(123) 4 Mb --- Generating MIP model m --- ran10x10c.gms(124) 4 Mb --- 121 rows 201 columns 601 non-zeroes --- 100 discrete-columns --- Executing Cbc: elapsed 0:00:00.010 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: 200 columns and 120 rows. 100 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 11203.1 - 0.00 seconds processed model has 120 rows, 200 columns (100 integer) and 400 elements Pass 1: suminf. 1.51345 obj. 11655.2 iterations 21 Solution found of 14909 Before mini branch and bound, 85 integers at bound fixed and 85 continuous Full problem 120 rows 200 columns, reduced to 16 rows 18 columns Mini branch and bound improved solution from 14909 to 14743 (0.01 seconds) Round again with cutoff of 14389 Pass 2: suminf. 1.51345 obj. 11665 iterations 19 Pass 3: suminf. 1.51345 obj. 11665 iterations 4 Pass 4: suminf. 0.51895 obj. 14389 iterations 24 Pass 5: suminf. 0.50786 obj. 14389 iterations 15 Pass 6: suminf. 1.30743 obj. 14389 iterations 20 Pass 7: suminf. 1.28895 obj. 14389 iterations 4 Pass 8: suminf. 0.36326 obj. 14389 iterations 21 Pass 9: suminf. 0.50000 obj. 14252 iterations 12 Pass 10: suminf. 3.23526 obj. 14389 iterations 92 Pass 11: suminf. 1.75296 obj. 14389 iterations 27 Pass 12: suminf. 1.56740 obj. 14389 iterations 6 Pass 13: suminf. 1.70970 obj. 14389 iterations 26 Pass 14: suminf. 1.30523 obj. 14389 iterations 8 Pass 15: suminf. 1.08085 obj. 14389 iterations 24 Pass 16: suminf. 1.05020 obj. 14389 iterations 17 Pass 17: suminf. 1.30523 obj. 14389 iterations 17 Pass 18: suminf. 4.23059 obj. 14389 iterations 61 Pass 19: suminf. 3.30099 obj. 14389 iterations 24 Pass 20: suminf. 3.16797 obj. 14389 iterations 10 Pass 21: suminf. 2.48241 obj. 14389 iterations 2 Before mini branch and bound, 59 integers at bound fixed and 60 continuous Full problem 120 rows 200 columns, reduced to 56 rows 77 columns Mini branch and bound did not improve solution (0.10 seconds) After 0.10 seconds - Feasibility pump exiting with objective of 5 - took 0.10 seconds Integer solution of 14909 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) Full problem 120 rows 200 columns, reduced to 0 rows 0 columns 37 added rows had average density of 32.9189 At root node, 37 cuts changed objective from 11203.1 to 12438.2 in 31 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.300 seconds - new frequency is 10 Cut generator 1 (Gomory) - 79 row cuts (3 active), 0 column cuts in 0.032 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 150 row cuts (12 active), 0 column cuts in 0.056 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) - 67 row cuts (17 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 49 row cuts (3 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 249 row cuts (2 active), 0 column cuts in 0.040 seconds - new frequency is -100 After 0 nodes, 1 on tree, 14909 best solution, best possible 12438.2 (0.77 seconds) Cbc0038I Full problem 120 rows 200 columns, reduced to 18 rows 21 columns Cbc0038I Full problem 120 rows 200 columns, reduced to 0 rows 0 columns Cbc0038I Full problem 120 rows 200 columns, reduced to 19 rows 22 columns Cbc0038I Full problem 120 rows 200 columns, reduced to 18 rows 21 columns Cbc0038I Full problem 120 rows 200 columns, reduced to 29 rows 36 columns Cbc0038I Full problem 120 rows 200 columns, reduced to 19 rows 22 columns Solved to optimality. wallclocktime: 4.63872 used seconds: 8.35 MIP solution: 13007 (496 nodes, 8.35 seconds) Best possible: 13007 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran10x10c.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10c.gms Stop 07/18/08 15:09:46 elapsed 0:00:04.672