Build (method = -2) #dp: 9949 Step-3' Graph: 659 vertices and 3574 arcs (0.07s) Step-4' Graph: 651 vertices and 3558 arcs (0.07s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.07s) Optimize a model with 661 rows, 3559 columns and 9383 nonzeros Presolve removed 35 rows and 90 columns Presolve time: 0.05s Presolved: 626 rows, 3469 columns, 9237 nonzeros Variable types: 0 continuous, 3469 integer (0 binary) Found heuristic solution: objective 50.0000000 Optimize a model with 626 rows, 3469 columns and 9237 nonzeros Presolved: 626 rows, 3469 columns, 9237 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.631e+03 Factor NZ : 4.049e+04 (roughly 2 MBytes of memory) Factor Ops : 4.497e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.69355638e+03 -8.92050317e+04 1.17e+05 2.22e-16 2.10e+02 0s 1 3.03098415e+02 -6.85667262e+04 1.52e+04 2.66e-15 3.41e+01 0s 2 1.70985094e+02 -2.71119002e+04 3.54e+03 1.44e-15 8.30e+00 0s 3 1.63987007e+02 -1.38361037e+04 1.33e+03 9.33e-15 3.37e+00 0s 4 1.06994986e+02 -4.81356920e+03 4.24e+02 5.33e-15 1.12e+00 0s 5 1.20720941e+02 -2.35001859e+03 1.20e+02 1.07e-14 4.51e-01 0s 6 1.16854158e+02 -4.71804788e+02 1.26e+01 7.55e-15 8.96e-02 0s 7 9.65855775e+01 -3.59716676e+02 2.33e+00 6.66e-15 6.64e-02 0s 8 8.52665200e+01 -1.83393285e+02 1.37e+00 4.18e-15 3.90e-02 0s 9 7.61495330e+01 -1.31557283e+02 4.77e-13 3.27e-15 2.99e-02 0s 10 6.81652916e+01 -9.61363195e+01 3.83e-13 2.47e-15 2.37e-02 0s 11 6.24690059e+01 -8.54879096e+01 3.39e-13 2.15e-15 2.13e-02 0s 12 5.12743493e+01 -6.97611864e+01 2.43e-13 1.84e-15 1.74e-02 0s 13 3.42240289e+01 -3.26973443e+01 1.49e-13 8.67e-16 9.63e-03 0s 14 2.41947810e+01 -1.72009243e+01 9.62e-14 5.07e-16 5.96e-03 0s 15 1.58051422e+01 -6.85770997e+00 1.29e-13 3.11e-16 3.26e-03 0s 16 1.21452042e+01 -1.98285761e+00 4.62e-13 3.17e-16 2.03e-03 0s 17 1.09110875e+01 1.97953890e+00 3.97e-13 2.14e-16 1.29e-03 0s 18 1.11020584e+01 4.41237158e+00 3.78e-13 1.99e-16 9.63e-04 0s 19 9.52606272e+00 5.94886459e+00 1.96e-13 3.33e-16 5.15e-04 0s 20 9.56389864e+00 6.39427147e+00 1.87e-13 2.22e-16 4.56e-04 0s 21 9.33876766e+00 7.60785049e+00 1.65e-13 1.71e-16 2.49e-04 0s 22 8.90817539e+00 8.29803065e+00 1.85e-13 2.26e-16 8.78e-05 0s 23 8.87071588e+00 8.55879345e+00 1.08e-13 2.27e-16 4.49e-05 0s 24 8.83910547e+00 8.64598149e+00 9.30e-14 2.22e-16 2.78e-05 0s 25 8.81226481e+00 8.70929752e+00 1.28e-13 1.44e-16 1.48e-05 0s 26 8.78797831e+00 8.76395276e+00 3.96e-14 2.22e-16 3.46e-06 0s 27 8.78306610e+00 8.77609907e+00 1.61e-13 2.68e-16 1.00e-06 0s 28 8.78202050e+00 8.78190207e+00 2.57e-13 2.92e-16 1.70e-08 0s 29 8.78200000e+00 8.78200000e+00 2.75e-13 2.83e-16 1.97e-13 0s Barrier solved model in 29 iterations and 0.16 seconds Optimal objective 8.78200000e+00 Root relaxation: objective 8.782000e+00, 1435 iterations, 0.19 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 8.78200 0 49 50.00000 8.78200 82.4% - 0s H 0 0 10.0000000 8.78200 12.2% - 0s H 0 0 9.0000000 8.78200 2.42% - 0s Explored 0 nodes (4691 simplex iterations) in 0.63 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.000000000000e+00, best bound 9.000000000000e+00, gap 0.0% Preprocessing time: 0.10 seconds Gurobi run time: 0.63 seconds Total run time: 0.73 seconds Objective: 9 Solution: 1 x [1, 1, 2, 2, 2, 4, 5, 9, 10] 2 x [1, 1, 2, 3, 3, 3, 4, 5, 5, 5, 7, 8, 9] 3 x [2, 3, 3, 4, 4, 5, 7, 8, 9, 10] 1 x [1, 2, 3, 4, 4, 4, 8, 9, 10] 2 x [1, 2, 2, 2, 5, 5, 5, 6, 6, 10, 10, 10, 10]