Build (method = -2) #dp: 281 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 780.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.70378571e+03 -4.31508351e+03 5.79e+02 2.22e-16 2.11e+02 0s 1 7.53494322e+02 -1.70985712e+03 3.07e+01 3.33e-16 3.34e+01 0s 2 3.79572260e+02 1.38031360e+01 3.18e-02 4.39e-15 4.23e+00 0s 3 2.57594586e+02 1.83057811e+02 4.14e-04 8.88e-16 8.57e-01 0s 4 2.50505912e+02 2.45845657e+02 2.42e-05 1.18e-16 5.36e-02 0s 5 2.50000229e+02 2.49998791e+02 4.18e-09 2.08e-16 1.65e-05 0s 6 2.50000000e+02 2.50000000e+02 7.80e-14 4.44e-16 1.65e-11 0s Barrier solved model in 6 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: 22 x [4, 6, 8, 9] 3 x [1, 3, 4, 8] 102 x [2, 3, 3, 4] 8 x [1, 4, 7, 8] 84 x [1, 2, 4, 5] 1 x [2, 4, 6, 8] 30 x [3, 5, 6, 8]