SOLUTION: maximize P = 6x = 3y subject to: material 20x + 5y <= 600lbs. machinery 25x + 20y <= 1000 hrs labor 20x + 30y <= 1200hrs x, y > 0

Algebra.Com
Question 1192160: maximize P = 6x = 3y
subject to:
material 20x + 5y <= 600lbs.
machinery 25x + 20y <= 1000 hrs
labor 20x + 30y <= 1200hrs
x, y > 0

Found 2 solutions by Theo, ikleyn:
Answer by Theo(13342)   (Show Source): You can put this solution on YOUR website!
using the desmos.com calculator, you would graph the opposite of the constraint inequalities.
the feasible region is the unshaded portion of the graph.
evaluate the objective function at the corner points of the feasible region.
the corner point with the maximum profit is your solution.
if your maximum solution have fractions, then you would need to adjust so that they come out as integers.
your constraints must all be met at the maximum solution.
my graph is shown below:

the maximum solution is at (x,y) = (25.455,18.182) = 207.276.
if the solution needs to be integer, then use (x,y) = (25,18).
maximum solution will then become 204.
all constraints will have been met.




Answer by ikleyn(53937)   (Show Source): You can put this solution on YOUR website!
.

Notice that the objective function is written INCORRECTLY in your post.



RELATED QUESTIONS

maximize P = 6x = 3y subject to: material 20x + 5y <= 600lbs. machinery 25x + 20y <= (answered by greenestamps)
use the graphical method to solve the following linear programming problem. restrict... (answered by ikleyn)
how to find the radius and center of 25x^2+25y^2-20x+30y+13=0 (answered by josgarithmetic,Alan3354)
Linear Programming: Maximize P=40x+60y 10y is less than or equal to 10x+30 10y is... (answered by psbhowmick)
LINEAR PROGRAMMING The maximum value of z = 20x + 8y subject to 3x + y <= 8 2x + (answered by stanbon)
25x² +20x+4 = 0 (answered by checkley79)
Maximize P=3x + 2y Subject to 2x +3y ≤ 12 (answered by math_tutor2020)
20x+3y=20 and -20x+5y=60 using elimination 20x+3y=20 -20x+5(10)=60... (answered by mananth)
Use the graphical method to solve the following linear programming problem. Restrict x... (answered by Edwin McCravy)