# finite math 3

 1. Check that the given simplex tableau is in final form. Find the solution to the associated regular linear programming problem. 2. Find the maximum value of p = 2x + 3y subject to 2x + y ≤ 15 x + 3y ≤ 20 x ≥ 0, y ≥ 0 3. Check that the given simplex tableau is in final form. Find the solution to the associated regular linear programming problem. 4. Check that the given simplex tableau is not in final form. Find the pivot element to be used in the next iteration of the simplex method. 5. Find the pivot element to be used in the next iteration of the simplex method. 6. Find the pivot element to be used in the next iteration of the simplex method. 7. Determine whether the given simplex table is in the final form. If so, find the solution to the associated regular linear programming problem. 8. Solve the linear programming problem by the simplex method. 9. Solve the linear programming problem by the simplex method. 10. Solve the linear programming problem by the simplex method. 11. Solve the linear programming problem by the simplex method. 12. Solve the linear programming problem by the simplex method. 13. Solve the linear programming problem by the simplex method. 14. Solve the linear programming problem by the simplex method. 15. Solve the linear programming problem by the simplex method. 16. Maximize P= 10x + 12y subject to 17. Maximize P = 3x + 5y + 2z subject to 18. Consider the linear programming problem. Sketch the feasible set for the linear programming problem. 19. Find the minimum value of c = 4x + 5y subject to x + 2y ≥ 10 2x + 3y ≥ 18 x ≥ 0, y ≥ 0 20. Consider the linear programming problem. Sketch the feasible set for the linear programming problem.

[removed]

[removed][removed] 