Graph the feasible region subject to the following constraints: [ egin{array}{c} 50 x+20 y geq 2400 \ 30 x+20 y geq 1800 \ 10 x+40 y geq 1200 \ x geq 0 \ y geq 0 end{array} ]
Added by Jovany S.
Close
Step 1
First, we need to rewrite each inequality in the y = mx + b form: 50x + 20y ≥ 2400 becomes y ≥ -2.5x + 120 30x + 20y ≥ 1800 becomes y ≥ -1.5x + 90 10x + 40y ≥ 1200 becomes y ≥ -0.25x + 30 Show more…
Show all steps
Your feedback will help us improve your experience
Gregory Higby and 100 other Finite Mathematics and Calculus with Applications educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Recommended Videos
Graph the feasible region for the system of inequalities. 2y + x ≥ -2 y + 3x ≤ 9 y ≤ 0 x ≥ 0
Allison K.
Donna D.
Solve the linear programming problem by graphing. Graph the feasible region, list the extreme points and identify the maximum value of Z. You do not have to submit your graph, but please list the equations of the lines that form the feasible region. Minimize Z = 6x + 19y subject to 2x + 4y ≥ 22 3x + y ≥ 18 x, y ≥ 0
Kari H.
Recommended Textbooks
Finite Mathematics and Calculus with Applications
Understanding Our Universe
Further Pure Mathematics
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD