SOLUTION: Solve the linear programming programing by graphing and then determining which vertex maximizes the objective function M=3x+4y 5x+y≤25 2x+3y≤36 x≥0 y≥0 x = y

Algebra ->  Graphs -> SOLUTION: Solve the linear programming programing by graphing and then determining which vertex maximizes the objective function M=3x+4y 5x+y≤25 2x+3y≤36 x≥0 y≥0 x = y       Log On


   



Question 1198988: Solve the linear programming programing by graphing and then determining which vertex maximizes the objective function M=3x+4y
5x+y≤25
2x+3y≤36
x≥0
y≥0
x =
y =
What is the maximum value? M=

Answer by Theo(13342) About Me  (Show Source):
You can put this solution on YOUR website!
using he desmos.com calculator, graph the opposite of the inequalities.
the area of the graph that is not shaded is the region of feasibility.
the corner points of that region are where the maximum value of M = 3x + 4y will be located.
evaluate that equation at each of the corner points.
you will find that the maximum value of M is at the point (3,10).
at that point, the value of M is equal to 49.
this is what the graph looks like.