Question 3 25 pts If the objective function is to be maximized and all the variables involved are nonnegative, then the simplex method can be used to solve the linear programming problem. O True O False Question 4 25 pts In the simplex method, the pivot column is the column with the most negative number (to the left of the vertical bar) in the bottom row. Why? O This is not true. The pivot column is not always the column with the most negative number to the left of the vertical bar in the bottom row. O The most negative number corresponds to the variable that has the largest impact on the value of the objective function, so maximizing it first is most efficient. O The most negative number corresponds to the variable that has the smallest impact on the objective function, so maximizing it first is most efficient