--- Job mod010 Start 07/17/08 21:59:48 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 --- mod010.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod010.gdx --- mod010.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.019 --- mod010.gms(123) 4 Mb --- Generating MIP model m --- mod010.gms(124) 5 Mb --- 147 rows 2,656 columns 13,859 non-zeroes --- 2,655 discrete-columns --- mod010.gms(124) 5 Mb --- Executing Cbc: elapsed 0:00:00.058 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: 2655 columns and 146 rows. 2655 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 6532.08 - 0.05 seconds 27 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 83 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 144 rows, 2572 columns (2572 integer) and 10760 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 14.17391 obj. 6592.39 iterations 38 Pass 2: suminf. 2.50000 obj. 6732.25 iterations 127 Pass 3: suminf. 1.00000 obj. 6786 iterations 121 Pass 4: suminf. 1.00000 obj. 6786 iterations 0 Solution found of 7032 Before mini branch and bound, 2525 integers at bound fixed and 0 continuous Full problem 144 rows 2572 columns, reduced to 12 rows 14 columns Mini branch and bound improved solution from 7032 to 7030 (0.07 seconds) Round again with cutoff of 6980.21 Reduced cost fixing fixed 28 variables on major pass 2 Pass 5: suminf. 13.95652 obj. 6592.39 iterations 49 Pass 6: suminf. 0.00000 obj. 6809 iterations 326 Solution found of 6809 Before mini branch and bound, 2530 integers at bound fixed and 0 continuous Full problem 144 rows 2572 columns, reduced to 11 rows 12 columns Mini branch and bound did not improve solution (0.14 seconds) After 0.14 seconds - Feasibility pump exiting with objective of 3 - took 0.13 seconds Integer solution of 6809 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) Full problem 144 rows 2572 columns, reduced to 0 rows 0 columns Full problem 144 rows 2572 columns, reduced to 51 rows 362 columns Integer solution of 6548 found by greedy equality after 0 iterations and 0 nodes (0.24 seconds) Full problem 144 rows 2572 columns, reduced to 0 rows 0 columns At root node, 45 cuts changed objective from 6532.08 to 6532.08 in 1 passes Cut generator 0 (Probing) - 5 row cuts (45 active), 54 column cuts in 0.004 seconds - new frequency is 1 Cut generator 1 (Gomory) - 39 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.004 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.000 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 1 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Thread 0 used 0 times, waiting to start 0.00215213, 0 cpu time, 0 locks, 0 locked, 0 waiting for locks Thread 1 used 0 times, waiting to start 0.000246187, 0 cpu time, 0 locks, 0 locked, 0 waiting for locks Main thread 0 waiting for threads, 1 locks, 9.21905e-06 locked, 2.13354e-06 waiting for locks Search completed - best objective 6548, took 0 iterations and 0 nodes (0.30 seconds) Maximum depth 0, 2046 variables fixed on reduced cost Cuts at root node changed objective from 6532.08 to 6532.08 Probing was tried 3 times and created 15 cuts of which 135 were active after adding rounds of cuts (0.012 seconds) Gomory was tried 3 times and created 117 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 3 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Result - Finished objective 6548 after 0 nodes and 0 iterations - took 0.81 seconds (total time 0.87) Total time 0.88 Solved to optimality. wallclocktime: 0.92867 used seconds: 0.89 MIP solution: 6548 (0 nodes, 0.89 seconds) Best possible: 6548 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- mod010.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mod010.gms Stop 07/17/08 21:59:49 elapsed 0:00:01.021