Build (method = -2) #dp: 89 Step-3' Graph: 19 vertices and 54 arcs (0.00s) Step-4' Graph: 15 vertices and 46 arcs (0.00s) #V4/#V3 = 0.79 #A4/#A3 = 0.85 Ready! (0.00s) Optimize a model with 25 rows, 47 columns and 118 nonzeros Presolve removed 15 rows and 24 columns Presolve time: 0.00s Presolved: 10 rows, 23 columns, 56 nonzeros Variable types: 0 continuous, 23 integer (3 binary) Found heuristic solution: objective 95.0000000 Found heuristic solution: objective 84.0000000 Found heuristic solution: objective 81.0000000 Found heuristic solution: objective 80.0000000 Optimize a model with 10 rows, 23 columns and 56 nonzeros Presolved: 10 rows, 23 columns, 56 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.600e+01 Factor NZ : 5.500e+01 Factor Ops : 3.850e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.97732540e+01 -1.32395203e+02 3.51e+01 6.15e-02 7.92e+00 0s 1 8.13318417e+01 3.53657061e+01 7.94e-02 5.55e-16 9.69e-01 0s 2 7.21245647e+01 6.74267533e+01 1.50e-03 6.66e-16 9.80e-02 0s 3 7.10077645e+01 7.09821404e+01 1.07e-14 3.33e-16 5.34e-04 0s 4 7.10000078e+01 7.09999821e+01 2.84e-14 2.00e-16 5.34e-07 0s 5 7.10000000e+01 7.10000000e+01 1.07e-14 3.45e-16 5.34e-13 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 7.10000000e+01 Root relaxation: objective 7.100000e+01, 13 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 71.0000000 71.00000 0.0% - 0s Explored 0 nodes (13 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.100000000000e+01, best bound 7.100000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 71 Solution: 15 x [6] 11 x [1] 1 x [1, 8] 13 x [5, 8] 1 x [4, 5] 7 x [7] 10 x [9] 2 x [3] 10 x [3, 10] 1 x [2, 2, 2, 2, 3]