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. True False statements