Question 117459: Graph the system of constraints. Then find the values of x and y that maximize A=20x+30y and list the maximum value.
x greater then or equal to 0
y greater then or equal to 0
-2x+4y less then or equal to 4
x less then or equal to 4
Answer by Fombitz(32388)   (Show Source):
You can put this solution on YOUR website! The constraints marks the feasible region that lies on and within this green lined polygon.
From linear programming, a solution exists at one of the bounding vertices (0,0), (0,1), (4,0), or (4,3).
A=20x+30y
A(0,0) = 20(0)+ 30(0)= 0
A(0,1) = 20(0)+ 30(1) = 30
A(4,0) = 20(4)+ 30(0) = 80
A(4,3) = 20(4)+ 30(3) = 170
The (x,y) pair that maximizes A in the feasible region is (4,3).
|
|
|
