Build (method = -2) #dp: 219 Step-3' Graph: 24 vertices and 97 arcs (0.00s) Step-4' Graph: 19 vertices and 87 arcs (0.00s) #V4/#V3 = 0.79 #A4/#A3 = 0.90 Ready! (0.00s) Optimize a model with 38 rows, 88 columns and 237 nonzeros Presolve removed 24 rows and 48 columns Presolve time: 0.00s Presolved: 14 rows, 40 columns, 106 nonzeros Variable types: 0 continuous, 40 integer (0 binary) Found heuristic solution: objective 163.0000000 Optimize a model with 14 rows, 40 columns and 106 nonzeros Presolved: 14 rows, 40 columns, 106 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.000e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.17842746e+02 -1.96505328e+02 1.44e+02 1.11e-16 9.16e+00 0s 1 1.50395629e+02 4.54217839e+01 2.49e-14 3.33e-16 1.25e+00 0s 2 1.26532548e+02 1.13121032e+02 1.42e-14 3.33e-16 1.58e-01 0s 3 1.23077056e+02 1.22587526e+02 7.11e-14 1.51e-16 5.76e-03 0s 4 1.23000081e+02 1.22999590e+02 3.55e-14 2.22e-16 5.78e-06 0s 5 1.23000000e+02 1.23000000e+02 1.78e-14 2.22e-16 1.02e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.23000000e+02 Root relaxation: objective 1.230000e+02, 24 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 (24 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: 7 x [15] 1 x [18] 8 x [12, 18] 1 x [2] 1 x [1, 11] 13 x [11, 19] 32 x [4] 3 x [4, 11] 5 x [14] 10 x [8, 14] 11 x [3, 13] 3 x [6, 7] 1 x [3, 7] 12 x [5, 9] 1 x [3, 5] 1 x [6, 16] 1 x [10, 16] 7 x [6, 10] 5 x [3, 17]