After an iteration of the simplex method, if all the coefficients in the objective function row are non$-$negative, what does this indicate? More iterations are needed to find the optimal solution. The linear program has no solution. The current solution is infeasible. The algorithm has reached an optimal solution