in exercises 1-5 the given tableau represents a solution to a linear programming problem that satisfies the optimality criterion, but is infeasible. use the dual simplex method to restore feasibility.