Build (method = -2) #dp: 335 Step-3' Graph: 42 vertices and 115 arcs (0.00s) Step-4' Graph: 7 vertices and 45 arcs (0.00s) #V4/#V3 = 0.17 #A4/#A3 = 0.39 Ready! (0.00s) Optimize a model with 15 rows, 46 columns and 132 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 13 rows, 44 columns, 128 nonzeros Variable types: 0 continuous, 44 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 973.0000000 Optimize a model with 13 rows, 44 columns and 128 nonzeros Presolved: 13 rows, 44 columns, 128 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.700e+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 3.12706136e+03 -5.88204274e+03 1.04e+03 1.11e-16 2.77e+02 0s 1 8.17862074e+02 -2.47358868e+03 6.55e+01 5.55e-16 4.24e+01 0s 2 3.94595639e+02 -6.17637465e+01 1.84e-02 2.41e-14 4.78e+00 0s 3 2.13679936e+02 1.40369798e+02 1.20e-03 2.89e-15 7.64e-01 0s 4 2.01082407e+02 1.97004263e+02 9.83e-05 3.68e-16 4.25e-02 0s 5 2.00000901e+02 1.99995635e+02 7.76e-14 4.44e-16 5.49e-05 0s 6 2.00000000e+02 2.00000000e+02 5.97e-14 3.13e-16 5.50e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+02 Root relaxation: objective 2.000000e+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 200.0000000 200.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.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: 22 x [1, 2, 3, 4, 6] 5 x [1, 2, 2, 4, 4] 110 x [3, 4, 5, 6, 7] 2 x [2, 2, 4, 6, 8] 3 x [2, 2, 4, 4, 8] 9 x [2, 2, 2, 4, 4] 49 x [2, 2, 6, 6, 7]