Build (method = -2) #dp: 223 Step-3' Graph: 38 vertices and 104 arcs (0.00s) Step-4' Graph: 6 vertices and 40 arcs (0.00s) #V4/#V3 = 0.16 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 15 rows, 41 columns and 118 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 13 rows, 39 columns, 114 nonzeros Variable types: 0 continuous, 39 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 909.0000000 Optimize a model with 13 rows, 39 columns and 114 nonzeros Presolved: 13 rows, 39 columns, 114 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.100e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.33253571e+03 -4.31032870e+03 4.55e+02 2.22e-16 1.80e+02 0s 1 6.35830960e+02 -1.54415961e+03 5.40e-13 2.78e-16 2.59e+01 0s 2 3.51081964e+02 8.40224490e+01 1.63e-13 2.22e-16 3.09e+00 0s 3 2.51158897e+02 2.41563256e+02 1.07e-13 2.22e-16 1.10e-01 0s 4 2.50001203e+02 2.49991592e+02 5.95e-14 1.11e-16 1.10e-04 0s 5 2.50000000e+02 2.50000000e+02 1.69e-13 7.77e-17 1.10e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.50000000e+02 Root relaxation: objective 2.500000e+02, 32 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 250.0000000 250.00000 0.0% - 0s Explored 0 nodes (32 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+02, best bound 2.500000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 250 Solution: 16 x [1, 4, 7, 8] 75 x [1, 5, 7, 9] 94 x [2, 3, 6, 8] 1 x [1, 6, 8, 8] 43 x [1, 3, 4, 6] 14 x [1, 1, 5, 6] 3 x [1, 1, 5, 8] 4 x [1, 4, 8, 8]