4) The objective of a linear programming problem is to maximize 1.50A +1.50B, subject to 3A + 2B 600, 2A +4B 600, and 1A + 3B 420. a. Plot the constraints. b. Identify the feasible region and its corner points. Show your work. c. What is the optimal product mix for this problem? (Apply corner method) d. Show binding and non binding constraints.

4) (30pts) The objective of a linear programming problem is to maximize 1.50A+1.50B, subject to 3A+ 2B600,2A+4B600, and 1A+3B420. a. Plot the constraints. b. Identify the feasible region and its corner points. Show your work. c. What is the optimal product mix for this problem? (Apply corner method) d. Show binding and non binding constraints