1. (6 points) Consider the following linear programming problem:
Max 5X + 2Y
s.t.
1X – 2Y
2X + 3Y
6X – 1Y
X, Y >= 0
Graph the constraints and shade the area that represents the feasible region. (Paste graph below.) Find the solution to the problem using either the extreme points method or the iso profit method. What is the maximum feasible value of the objective function?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here