In the Simplex method, when is the optimal solution reached?

a) When all entries in the objective row are positive

b) When the feasible region is empty

c) When all entries in the objective row are non-positive

d) When the constraints are minimized