Build (method = -2) #dp: 40 Step-3' Graph: 14 vertices and 33 arcs (0.00s) Step-4' Graph: 5 vertices and 15 arcs (0.00s) #V4/#V3 = 0.36 #A4/#A3 = 0.45 Ready! (0.00s) Optimize a model with 9 rows, 16 columns and 44 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 7 rows, 14 columns, 40 nonzeros Variable types: 0 continuous, 14 integer (0 binary) Found heuristic solution: objective 182.0000000 Found heuristic solution: objective 165.0000000 Optimize a model with 7 rows, 14 columns and 40 nonzeros Presolved: 7 rows, 14 columns, 40 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.500e+01 Factor NZ : 2.800e+01 Factor Ops : 1.400e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.20398690e+02 -4.28266068e+02 8.70e+01 0.00e+00 4.69e+01 0s 1 1.06854735e+02 -9.21631736e+01 5.92e-03 2.22e-16 6.33e+00 0s 2 6.51645223e+01 4.04375099e+01 8.04e-05 2.22e-16 7.74e-01 0s 3 6.10898492e+01 6.07134094e+01 2.14e-14 2.22e-16 1.18e-02 0s 4 6.10000905e+01 6.09997140e+01 1.03e-14 1.23e-16 1.18e-05 0s 5 6.10000000e+01 6.10000000e+01 2.19e-14 3.33e-16 1.18e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 6.10000000e+01 Root relaxation: objective 6.100000e+01, 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 61.0000000 61.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 6.100000000000e+01, best bound 6.100000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 61 Solution: 17 x [1, 2, 4] 1 x [1, 1, 2] 30 x [1, 1, 4] 13 x [1, 1, 3]