--- Job markshare1 Start 07/17/08 19:33:24 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 --- markshare1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/markshare1.gdx --- markshare1.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.004 --- markshare1.gms(123) 4 Mb --- Generating MIP model m --- markshare1.gms(124) 4 Mb --- 7 rows 63 columns 325 non-zeroes --- 50 discrete-columns --- Executing Cbc: elapsed 0:00:00.007 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: 62 columns and 6 rows. 50 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 0 - -0.00 seconds 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 6 rows, 56 columns (50 integer) and 306 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 0.29032 obj. 228.484 iterations 6 Pass 2: suminf. 0.00000 obj. 589 iterations 1 Solution found of 589 Before mini branch and bound, 43 integers at bound fixed and 0 continuous Full problem 6 rows 56 columns, reduced to 6 rows 13 columns Mini branch and bound improved solution from 589 to 150 (0.00 seconds) Round again with cutoff of 135 Pass 3: suminf. 0.48092 obj. 135 iterations 13 Pass 4: suminf. 0.22149 obj. 135 iterations 2 Pass 5: suminf. 0.18765 obj. 125.716 iterations 4 Pass 6: suminf. 0.46423 obj. 135 iterations 5 Pass 7: suminf. 0.35008 obj. 135 iterations 3 Pass 8: suminf. 1.11137 obj. 135 iterations 4 Pass 9: suminf. 0.91803 obj. 135 iterations 2 Pass 10: suminf. 1.33719 obj. 135 iterations 11 Pass 11: suminf. 0.85350 obj. 135 iterations 3 Pass 12: suminf. 0.59556 obj. 135 iterations 8 Pass 13: suminf. 0.29855 obj. 135 iterations 5 Pass 14: suminf. 1.14929 obj. 135 iterations 4 Pass 15: suminf. 0.78947 obj. 135 iterations 5 Pass 16: suminf. 0.61781 obj. 135 iterations 4 Pass 17: suminf. 0.69192 obj. 135 iterations 5 Pass 18: suminf. 1.00273 obj. 135 iterations 2 Pass 19: suminf. 0.56752 obj. 135 iterations 5 Pass 20: suminf. 0.69922 obj. 135 iterations 2 Pass 21: suminf. 0.46487 obj. 135 iterations 2 Pass 22: suminf. 0.57220 obj. 135 iterations 1 Before mini branch and bound, 28 integers at bound fixed and 0 continuous Full problem 6 rows 56 columns, reduced to 6 rows 28 columns Mini branch and bound did not improve solution (0.05 seconds) After 0.05 seconds - Feasibility pump exiting with objective of 1.11022e-16 - took 0.05 seconds Integer solution of 589 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) Full problem 6 rows 56 columns, reduced to 1 rows 23 columns Full problem 6 rows 56 columns, reduced to 6 rows 35 columns Integer solution of 144 found by greedy equality after 0 iterations and 0 nodes (0.06 seconds) Full problem 6 rows 56 columns, reduced to 5 rows 29 columns 3 added rows had average density of 50.3333 At root node, 3 cuts changed objective from 0 to 0 in 100 passes Cut generator 0 (Probing) - 5 row cuts (0 active), 1 column cuts in 0.176 seconds - new frequency is 4 Cut generator 1 (Gomory) - 695 row cuts (1 active), 0 column cuts in 0.004 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 209 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 429 row cuts (2 active), 0 column cuts in 0.020 seconds - new frequency is -100 After 0 nodes, 1 on tree, 144 best solution, best possible 0 (0.37 seconds) Cbc0012I Integer solution of 122 found by greedy equality after 789 iterations and 2 nodes (0.38 seconds) Cbc0038I Full problem 6 rows 56 columns, reduced to 5 rows 29 columns Cbc0038I Full problem 6 rows 56 columns, reduced to 6 rows 40 columns Cbc0012I Integer solution of 100 found by greedy equality after 996 iterations and 17 nodes (0.52 seconds) Cbc0038I Full problem 6 rows 56 columns, reduced to 6 rows 42 columns Cbc0038I Full problem 6 rows 56 columns, reduced to 6 rows 40 columns Cbc0004I Integer solution of 46 found after 15942 iterations and 1762 nodes (3.96 seconds) Cbc0038I Full problem 6 rows 56 columns, reduced to 6 rows 40 columns Cbc0038I Full problem 6 rows 56 columns, reduced to 6 rows 46 columns Cbc0012I Integer solution of 36 found by combine solutions after 15966 iterations and 1765 nodes (4.44 seconds) Cbc0038I Full problem 6 rows 56 columns, reduced to 6 rows 46 columns Cbc0004I Integer solution of 28 found after 69411 iterations and 9276 nodes (8.09 seconds) Cbc0038I Full problem 6 rows 56 columns, reduced to 6 rows 51 columns Cbc0004I Integer solution of 18 found after 265707 iterations and 52752 nodes (23.81 seconds) Cbc0038I Full problem 6 rows 56 columns, reduced to 6 rows 53 columns Node limit reached. Have feasible solution. wallclocktime: 392.434 used seconds: 397.25 MIP solution: 18 (999999 nodes, 397.25 seconds) Best possible: 0 Absolute gap: 18 (absolute tolerance optca: 0) Relative gap: 18 (relative tolerance optcr: 0) --- Restarting execution --- markshare1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job markshare1.gms Stop 07/17/08 19:39:56 elapsed 0:06:32.477