When using the simplex method for maximizing the objective function value, you arrive at an optimal value when all the coefficients in the objective value function are 0 or negative. How is this different when the objective is to minimize? Is the solution optimal when the coefficients are all 0 or positive?

Are there any other differences such as the rules for choosing a pivot column and row when dealing with a min instead of a max?