Build (method = -2) #dp: 51 Step-3' Graph: 12 vertices and 34 arcs (0.00s) Step-4' Graph: 7 vertices and 24 arcs (0.00s) #V4/#V3 = 0.58 #A4/#A3 = 0.71 Ready! (0.00s) Optimize a model with 17 rows, 25 columns and 67 nonzeros Presolve removed 12 rows and 16 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 16 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Found heuristic solution: objective 857.0000000 Optimize a model with 5 rows, 9 columns and 16 nonzeros Presolved: 5 rows, 9 columns, 16 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.000e+00 Factor NZ : 1.500e+01 Factor Ops : 5.500e+01 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.82660072e+02 2.08101422e+02 1.77e+01 0.00e+00 4.34e+01 0s 1 8.01955452e+02 7.28203700e+02 0.00e+00 2.22e-16 3.38e+00 0s 2 7.78131064e+02 7.75986904e+02 1.42e-14 1.13e-16 9.75e-02 0s 3 7.77001132e+02 7.76998982e+02 0.00e+00 2.22e-16 9.78e-05 0s 4 7.77000001e+02 7.76999999e+02 0.00e+00 1.11e-16 9.78e-08 0s 5 7.77000000e+02 7.77000000e+02 0.00e+00 9.39e-18 1.03e-13 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 7.77000000e+02 Root relaxation: objective 7.770000e+02, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 777.0000000 777.00000 0.0% - 0s Explored 0 nodes (7 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.770000000000e+02, best bound 7.770000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 777 Solution: 2 x [1] 34 x [1, 10] 133 x [8] 57 x [6] 192 x [5] 170 x [3] 90 x [2, 7] 17 x [4, 7] 52 x [7, 9] 30 x [9, 9]