Consider the following linear programming problem:
Max 5X + 2Y.
Subject to:
1X – 2Y <= 420
2X + 3Y <= 610
6X – 1Y <= 125
X, Y >= 0
Graph the constraints and shade the area that represents the feasible region.
Find the solution to the problem using either the extreme points method or the isoprofit method.
What is the maximum feasible value of the objective function?