Build (method = -2) #dp: 390 Step-3' Graph: 42 vertices and 116 arcs (0.00s) Step-4' Graph: 6 vertices and 44 arcs (0.00s) #V4/#V3 = 0.14 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 16 rows, 45 columns and 130 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 14 rows, 43 columns, 126 nonzeros Variable types: 0 continuous, 43 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 972.0000000 Optimize a model with 14 rows, 43 columns and 126 nonzeros Presolved: 14 rows, 43 columns, 126 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.500e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.58284063e+03 -4.36107526e+03 4.82e+02 1.11e-16 1.83e+02 0s 1 6.49664033e+02 -1.83280863e+03 5.97e-13 4.44e-16 2.67e+01 0s 2 4.13340575e+02 -1.20432548e+02 1.99e-13 6.11e-16 5.63e+00 0s 3 2.53141827e+02 1.99170709e+02 9.33e-14 2.22e-16 5.62e-01 0s 4 2.50021475e+02 2.49584190e+02 1.75e-13 2.22e-16 4.56e-03 0s 5 2.50000000e+02 2.49999999e+02 2.45e-13 1.11e-16 8.45e-09 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.50000000e+02 Root relaxation: objective 2.500000e+02, 35 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 (35 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: 28 x [2, 3, 5, 10] 51 x [1, 3, 8, 9] 9 x [3, 8, 9, 10] 70 x [1, 2, 4, 6] 20 x [2, 6, 10, 10] 1 x [2, 3, 9, 10] 4 x [2, 9, 10, 10] 65 x [3, 4, 7, 10] 2 x [3, 4, 9, 10]