Build (method = -2) #dp: 3785 Step-3' Graph: 238 vertices and 840 arcs (0.02s) Step-4' Graph: 175 vertices and 714 arcs (0.02s) #V4/#V3 = 0.74 #A4/#A3 = 0.85 Ready! (0.02s) Optimize a model with 183 rows, 715 columns and 1808 nonzeros Presolve removed 48 rows and 96 columns Presolve time: 0.01s Presolved: 135 rows, 619 columns, 1642 nonzeros Variable types: 0 continuous, 619 integer (0 binary) Found heuristic solution: objective 996.0000000 Found heuristic solution: objective 862.0000000 Optimize a model with 135 rows, 619 columns and 1642 nonzeros Presolved: 135 rows, 619 columns, 1642 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.460e+02 Factor NZ : 3.240e+03 Factor Ops : 9.323e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.60286893e+03 -8.20455047e+04 7.20e+04 2.22e-16 3.96e+02 0s 1 1.95075481e+03 -4.06042110e+04 1.46e+04 6.66e-16 9.01e+01 0s 2 1.20936271e+03 -1.24220989e+04 3.11e+03 5.55e-16 2.04e+01 0s 3 9.45726354e+02 -1.80579845e+03 1.76e+02 4.00e-15 2.57e+00 0s 4 6.31107225e+02 -4.67130541e+02 1.87e+01 1.78e-15 9.06e-01 0s 5 2.80645656e+02 -1.77806592e+02 7.73e+00 4.44e-16 3.76e-01 0s 6 1.93876784e+02 -9.79089410e+01 4.71e+00 4.06e-16 2.39e-01 0s 7 1.49328437e+02 -3.45498075e+01 2.71e+00 3.51e-16 1.50e-01 0s 8 1.29931932e+02 2.41626151e+01 1.55e+00 2.72e-16 8.60e-02 0s 9 1.21595365e+02 5.43742397e+01 1.26e+00 2.26e-16 5.47e-02 0s 10 1.10258952e+02 8.22047926e+01 4.30e-01 2.22e-16 2.27e-02 0s 11 1.02406331e+02 9.76238900e+01 1.03e-01 2.65e-16 3.88e-03 0s 12 1.00044047e+02 9.98996677e+01 3.73e-13 2.76e-16 1.16e-04 0s 13 1.00000007e+02 9.99998546e+01 3.30e-13 2.22e-16 1.22e-07 0s 14 1.00000000e+02 1.00000000e+02 3.09e-13 2.59e-16 1.24e-13 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 1.00000000e+02 Root relaxation: objective 1.000000e+02, 328 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 100.0000000 100.00000 0.0% - 0s Explored 0 nodes (328 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.000000000000e+02, best bound 1.000000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.03 seconds Total run time: 0.05 seconds Objective: 100 Solution: 27 x [1, 2, 2, 2, 4, 4, 5, 5, 6, 6] 16 x [2, 3, 3, 3, 3, 3, 4, 5, 6, 7] 7 x [2, 2, 2, 3, 4, 6, 7, 7, 7, 7] 25 x [3, 4, 6, 6, 6, 6, 7, 7, 7, 7] 9 x [2, 3, 4, 4, 5, 5, 6, 6, 6, 7] 1 x [3, 4, 4, 4, 5, 5, 6, 6, 6, 7] 5 x [2, 2, 3, 3, 4, 4, 4, 6, 7, 8] 10 x [2, 2, 2, 4, 4, 4, 5, 5, 6, 6]