Build (method = -2) #dp: 2341 Step-3' Graph: 83 vertices and 749 arcs (0.01s) Step-4' Graph: 53 vertices and 689 arcs (0.01s) #V4/#V3 = 0.64 #A4/#A3 = 0.92 Ready! (0.01s) Optimize a model with 103 rows, 690 columns and 1971 nonzeros Presolve removed 2 rows and 7 columns Presolve time: 0.01s Presolved: 101 rows, 683 columns, 1957 nonzeros Variable types: 0 continuous, 683 integer (0 binary) Found heuristic solution: objective 3.799999e+07 Optimize a model with 101 rows, 683 columns and 1957 nonzeros Presolved: 101 rows, 683 columns, 1957 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.460e+02 Factor NZ : 2.373e+03 Factor Ops : 7.422e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.19918770e+09 -2.43075852e+09 7.43e+09 2.22e-16 1.40e+07 0s 1 2.90814885e+08 -6.98318054e+08 1.04e+09 7.77e-16 2.13e+06 0s 2 7.63677768e+07 -2.27227508e+08 1.17e+08 3.90e-14 3.40e+05 0s 3 4.20476420e+07 -4.95063411e+07 7.23e+06 6.22e-15 6.90e+04 0s 4 2.74370733e+07 -1.65598273e+07 1.32e+06 3.11e-15 3.16e+04 0s 5 2.35083937e+07 5.83744891e+06 5.76e+05 1.33e-15 1.26e+04 0s 6 2.14898327e+07 1.61473851e+07 1.56e+05 4.44e-16 3.80e+03 0s 7 2.04821234e+07 1.82770430e+07 3.52e+04 3.11e-16 1.56e+03 0s 8 2.01759575e+07 1.93182738e+07 1.03e+04 2.22e-16 6.07e+02 0s 9 2.00903808e+07 1.97482719e+07 4.17e+03 3.37e-16 2.42e+02 0s 10 2.00308595e+07 1.99163002e+07 9.31e+02 2.22e-16 8.10e+01 0s 11 2.00065188e+07 1.99811268e+07 1.07e+02 2.71e-16 1.79e+01 0s 12 2.00023729e+07 1.99932618e+07 1.82e+01 4.44e-16 6.44e+00 0s 13 2.00003190e+07 1.99981921e+07 8.99e-01 2.32e-16 1.50e+00 0s 14 2.00000055e+07 1.99999809e+07 2.10e-03 4.44e-16 1.74e-02 0s 15 2.00000000e+07 2.00000000e+07 4.73e-09 1.23e-09 2.06e-08 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.00000000e+07 Root relaxation: objective 2.000000e+07, 176 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 2.000000e+07 2.0000e+07 0.0% - 0s Explored 0 nodes (176 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+07, best bound 2.000000000000e+07, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.03 seconds Total run time: 0.04 seconds Objective: 20000000 Solution: 1000000 x [19, 47, 49] 1000000 x [1, 44, 48] 1000000 x [5, 40, 48] 1000000 x [6, 33, 48] 1000000 x [4, 8, 50] 1000000 x [3, 10, 36] 1000000 x [4, 10, 35] 1000000 x [12, 16, 22] 1000000 x [11, 20, 26] 1000000 x [13, 21, 23] 1000000 x [13, 18, 25] 1000000 x [9, 30, 31] 1000000 x [14, 17, 29] 1000000 x [2, 42, 48] 1000000 x [7, 38, 46] 1000000 x [15, 32, 46] 1000000 x [12, 37, 45] 1000000 x [24, 28, 45] 1000000 x [12, 41, 43] 1000000 x [27, 34, 39]