Build (method = -2) #dp: 164 Step-3' Graph: 18 vertices and 71 arcs (0.00s) Step-4' Graph: 14 vertices and 63 arcs (0.00s) #V4/#V3 = 0.78 #A4/#A3 = 0.89 Ready! (0.00s) Optimize a model with 33 rows, 64 columns and 173 nonzeros Presolve removed 22 rows and 39 columns Presolve time: 0.00s Presolved: 11 rows, 25 columns, 64 nonzeros Variable types: 0 continuous, 25 integer (2 binary) Found heuristic solution: objective 174.0000000 Found heuristic solution: objective 153.0000000 Optimize a model with 11 rows, 25 columns and 64 nonzeros Presolved: 11 rows, 25 columns, 64 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.800e+01 Factor NZ : 6.600e+01 Factor Ops : 5.060e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.39485201e+02 -1.41119682e+02 7.46e+01 1.11e-16 1.30e+01 0s 1 1.60130639e+02 5.23699835e+01 2.22e+00 2.22e-16 2.09e+00 0s 2 1.28837087e+02 1.18830117e+02 8.62e-03 3.33e-16 1.86e-01 0s 3 1.23239516e+02 1.22343139e+02 5.10e-04 3.33e-16 1.66e-02 0s 4 1.23002581e+02 1.22998483e+02 1.58e-06 4.44e-16 7.59e-05 0s 5 1.23000000e+02 1.23000000e+02 1.73e-12 2.22e-16 9.17e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.23000000e+02 Root relaxation: objective 1.230000e+02, 10 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 123.0000000 123.00000 0.0% - 0s Explored 0 nodes (10 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.230000000000e+02, best bound 1.230000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 123 Solution: 12 x [7] 17 x [18] 1 x [12] 4 x [16] 1 x [13, 19] 9 x [13, 13, 19] 1 x [1, 5] 1 x [5, 14] 3 x [1, 9] 7 x [3] 9 x [17] 11 x [8, 15] 5 x [11] 10 x [11, 15] 10 x [2, 4] 19 x [6, 10] 1 x [2, 10] 2 x [2, 6]