Problem:
Corner point method
Consider the following linear program.
Maximize Profit = 20X + 8Y
Subject to: X + Y < 12 Constraint #1
X + 3Y < 27 Constraint #2
4X + 2Y < 40 Constraint #3
X, Y > 0
Solve this graphically below using the corner point method.
(1) What is the maximum possible profit?
(2) How much slack is there for the point (0,9) in the first constraint?
(3) What is the maximum possible profit if the objective function is changed to Maximize 20X + 22Y?
(4) Give the coordinates (X,Y) of the point where constraints 1 and 2 intersect. Put your answer in the form (X,Y).