Build (method = -2) #dp: 943 Step-3' Graph: 52 vertices and 145 arcs (0.00s) Step-4' Graph: 7 vertices and 55 arcs (0.00s) #V4/#V3 = 0.13 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 17 rows, 56 columns and 162 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 15 rows, 54 columns, 158 nonzeros Variable types: 0 continuous, 54 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 968.0000000 Optimize a model with 15 rows, 54 columns and 158 nonzeros Presolved: 15 rows, 54 columns, 158 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.700e+01 Factor NZ : 1.200e+02 Factor Ops : 1.240e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.22977257e+03 -6.04429297e+03 8.57e+02 0.00e+00 2.34e+02 0s 1 7.99863792e+02 -2.56454394e+03 4.63e+01 4.44e-16 3.50e+01 0s 2 4.05404664e+02 -9.74329883e+01 4.31e-02 2.78e-16 4.30e+00 0s 3 2.13199234e+02 1.09021197e+02 2.29e-03 2.22e-16 8.83e-01 0s 4 2.00313747e+02 1.94713596e+02 3.07e-05 2.22e-16 4.75e-02 0s 5 2.00033543e+02 1.99963479e+02 2.22e-13 2.22e-16 5.94e-04 0s 6 2.00000000e+02 1.99999996e+02 1.12e-13 2.22e-16 3.15e-08 0s 7 2.00000000e+02 2.00000000e+02 4.66e-14 2.26e-16 6.20e-14 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 2.00000000e+02 Root relaxation: objective 2.000000e+02, 45 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 200.0000000 200.00000 0.0% - 0s Explored 0 nodes (45 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+02, best bound 2.000000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 200 Solution: 1 x [1, 2, 5, 7, 10] 4 x [1, 2, 3, 7, 10] 27 x [2, 3, 4, 7, 10] 2 x [1, 2, 2, 5, 6] 10 x [2, 3, 6, 10, 10] 1 x [1, 2, 6, 10, 10] 17 x [2, 2, 3, 6, 9] 67 x [2, 5, 8, 9, 10] 71 x [2, 4, 5, 9, 10]