solution

TRUE/FALSE STATEMENTS 1) ( _.) The sensitivity range for an objective function coefficient is the range of values over which the current optimal solution point will remain optimal. 2) _) The pivot column is the column corresponding to the leaving variable. 3) ( _) The entering variable is determined by dividing the quantity values by the pivot column values and selecting the minimum positive value. 4) _ The slack variable allows for an initial basic feasible solution, but it has no meaning. Therefore, after we get the simplex tableau started, they are discarded in later iterations. 5) An unbounded solution of a maximization linear programming problem has an artificial variable in the final simplex tableau where all cj – zj values are less than or equal to zero. 6) ( The sensitivity range for an objective function coefficient is the range of values over which the profit does change. 7) ) In solving a minimization problem, artificial variables are assigned a small cost in the objective function to eliminate them from the final solution. 8) _) A multiple solution problem can be identified in the simplex procedure when it is not possible to select a pivot row.