Build (method = -2) #dp: 46 Step-3' Graph: 15 vertices and 38 arcs (0.00s) Step-4' Graph: 7 vertices and 22 arcs (0.00s) #V4/#V3 = 0.47 #A4/#A3 = 0.58 Ready! (0.00s) Optimize a model with 17 rows, 23 columns and 59 nonzeros Presolve removed 9 rows and 9 columns Presolve time: 0.00s Presolved: 8 rows, 14 columns, 34 nonzeros Variable types: 0 continuous, 14 integer (0 binary) Optimize a model with 8 rows, 14 columns and 34 nonzeros Presolved: 8 rows, 14 columns, 34 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.700e+01 Factor NZ : 3.600e+01 Factor Ops : 2.040e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.14980645e+02 2.28102421e+02 2.43e+02 0.00e+00 5.83e+01 0s 1 7.67229532e+02 5.94373696e+02 5.68e-14 3.33e-16 6.40e+00 0s 2 7.35480719e+02 6.83169360e+02 4.26e-14 2.22e-16 1.94e+00 0s 3 7.27356294e+02 7.24862960e+02 2.13e-14 1.11e-16 9.23e-02 0s 4 7.27000359e+02 7.26997865e+02 4.97e-14 2.22e-16 9.24e-05 0s 5 7.27000000e+02 7.27000000e+02 1.42e-14 2.22e-16 9.24e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 7.27000000e+02 Root relaxation: objective 7.270000e+02, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 727.0000000 727.00000 0.0% - 0s Explored 0 nodes (5 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.270000000000e+02, best bound 7.270000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 727 Solution: 173 x [1] 77 x [2] 267 x [3] 61 x [4, 10] 39 x [5, 9] 15 x [6, 9] 4 x [7, 9] 26 x [7, 10] 63 x [8, 9, 10] 2 x [9, 10]