Build (method = -2) #dp: 169 Step-3' Graph: 20 vertices and 82 arcs (0.00s) Step-4' Graph: 15 vertices and 72 arcs (0.00s) #V4/#V3 = 0.75 #A4/#A3 = 0.88 Ready! (0.00s) Optimize a model with 34 rows, 73 columns and 196 nonzeros Presolve removed 22 rows and 43 columns Presolve time: 0.00s Presolved: 12 rows, 30 columns, 76 nonzeros Variable types: 0 continuous, 30 integer (0 binary) Found heuristic solution: objective 155.0000000 Optimize a model with 12 rows, 30 columns and 76 nonzeros Presolved: 12 rows, 30 columns, 76 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.100e+01 Factor NZ : 7.800e+01 Factor Ops : 6.500e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.01305827e+02 -1.49986510e+02 7.78e+01 2.22e-16 9.98e+00 0s 1 1.46503164e+02 5.04137827e+01 2.13e-13 1.94e-15 1.50e+00 0s 2 1.23311236e+02 1.13263208e+02 8.88e-15 1.17e-15 1.55e-01 0s 3 1.20037130e+02 1.19192958e+02 1.42e-14 1.55e-15 1.30e-02 0s 4 1.20000525e+02 1.19999188e+02 3.91e-14 1.22e-15 2.06e-05 0s 5 1.20000000e+02 1.20000000e+02 3.55e-15 6.66e-16 2.08e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.20000000e+02 Root relaxation: objective 1.200000e+02, 18 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 120.0000000 120.00000 0.0% - 0s Explored 0 nodes (18 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+02, best bound 1.200000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 120 Solution: 12 x [15, 19] 4 x [13] 4 x [13, 19] 16 x [8] 3 x [4] 7 x [4, 5] 3 x [9, 16] 5 x [7, 9] 17 x [11] 1 x [9, 11] 8 x [9, 12] 6 x [1, 18] 1 x [6, 14] 10 x [6, 10] 4 x [2, 3] 13 x [2, 14] 2 x [10, 17] 3 x [1, 17] 1 x [1, 10]