Great Deal! Get Instant \$10 FREE in Account on First Order + 10% Cashback on Every Order Order Now

# 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...

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?

Answered Same Day Nov 07, 2019

## Solution

David answered on Nov 30 2019
1. (6 points) Consider the following linear programming problem:

Max 5X + 2Y
s.t.
1X – 2Y <= 420
2X + 3Y <= 610
6X – 1Y <= 125
X, Y >= 0
Graph the constraints and shade the area that represents the feasible region. (Paste graph
elow.) Find the solution to the problem using either...
SOLUTION.PDF