--- Job stein27 Start 07/18/08 17:54:38 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 --- stein27.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/stein27.gdx --- stein27.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- stein27.gms(123) 4 Mb --- Generating MIP model m --- stein27.gms(124) 4 Mb --- 119 rows 28 columns 406 non-zeroes --- 27 discrete-columns --- Executing Cbc: elapsed 0:00:00.009 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: 27 columns and 118 rows. 27 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 13 - 0.00 seconds processed model has 118 rows, 27 columns (27 integer) and 378 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 7.00000 obj. 13 iterations 0 Solution found of 27 Before mini branch and bound, 6 integers at bound fixed and 0 continuous Full problem 118 rows 27 columns, reduced to 54 rows 21 columns Mini branch and bound improved solution from 27 to 18 (0.06 seconds) Round again with cutoff of 17.5 Pass 2: suminf. 7.00000 obj. 13 iterations 0 Pass 3: suminf. 1.35714 obj. 17.5 iterations 19 Pass 4: suminf. 0.83333 obj. 17.5 iterations 12 Pass 5: suminf. 8.60000 obj. 13 iterations 3 Pass 6: suminf. 5.33333 obj. 16.3333 iterations 28 Pass 7: suminf. 3.50000 obj. 17.5 iterations 6 Pass 8: suminf. 2.62500 obj. 17.5 iterations 14 Pass 9: suminf. 4.00000 obj. 16 iterations 32 Pass 10: suminf. 3.00000 obj. 17 iterations 9 Pass 11: suminf. 3.16667 obj. 17.5 iterations 1 Pass 12: suminf. 2.83333 obj. 17.5 iterations 1 Pass 13: suminf. 2.50000 obj. 17.5 iterations 9 Pass 14: suminf. 2.50000 obj. 17.5 iterations 0 Pass 15: suminf. 2.50000 obj. 17.5 iterations 6 Pass 16: suminf. 2.50000 obj. 17.5 iterations 0 Pass 17: suminf. 3.16667 obj. 17.5 iterations 12 Pass 18: suminf. 2.62500 obj. 17.5 iterations 22 Pass 19: suminf. 2.62500 obj. 17.5 iterations 2 Pass 20: suminf. 4.00000 obj. 16 iterations 34 Pass 21: suminf. 3.00000 obj. 17 iterations 7 Before mini branch and bound, 0 integers at bound fixed and 0 continuous Full problem 118 rows 27 columns, reduced to 118 rows 27 columns Mini branch and bound did not improve solution (0.16 seconds) After 0.16 seconds - Feasibility pump exiting with objective of 12 - took 0.16 seconds Integer solution of 18 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Full problem 118 rows 27 columns, reduced to 0 rows 0 columns 3 added rows had average density of 17.6667 At root node, 3 cuts changed objective from 13 to 13 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.024 seconds - new frequency is 10 Cut generator 1 (Gomory) - 2229 row cuts (3 active), 0 column cuts in 0.040 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.028 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) - 140 row cuts (0 active), 0 column cuts in 0.036 seconds - new frequency is -100 After 0 nodes, 1 on tree, 18 best solution, best possible 13 (0.42 seconds) Thread 0 used 302 times, waiting to start 0.0323717, 1951 locks, 0.00998844 locked, 0.00322096 waiting for locks Thread 1 used 296 times, waiting to start 0.0679228, 1911 locks, 0.00967287 locked, 0.00322797 waiting for locks Main thread 1.45642 waiting for threads, 1204 locks, 0.00206991 locked, 0.00205941 waiting for locks Search completed - best objective 18, took 8667 iterations and 598 nodes (3.19 seconds) Strong branching done 8788 times (60598 iterations), fathomed 262 nodes and fixed 21 variables Maximum depth 11, 2 variables fixed on reduced cost Cuts at root node changed objective from 13 to 13 Probing was tried 359 times and created 160 cuts of which 59 were active after adding rounds of cuts (0.096 seconds) Gomory was tried 486 times and created 9578 cuts of which 392 were active after adding rounds of cuts (0.192 seconds) Knapsack was tried 300 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) Clique was tried 300 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 300 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.084 seconds) FlowCover was tried 300 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 300 times and created 420 cuts of which 0 were active after adding rounds of cuts (0.108 seconds) Result - Finished objective 18 after 598 nodes and 8667 iterations - took 3.20 seconds (total time 3.20) Total time 3.20 Solved to optimality. wallclocktime: 1.90441 used seconds: 3.19 MIP solution: 18 (598 nodes, 3.19 seconds) Best possible: 18 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- stein27.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job stein27.gms Stop 07/18/08 17:54:40 elapsed 0:00:01.935