Solve the linear programming problem by the method of corners. Maximize $P = 3x + 7y$ subject to $x + y \le 10$ $3x + y \ge 12$ $-2x + 3y \ge 12$ $x \ge 0, y \ge 0$ The maximum is $P = $_____ at $(x, y) = ($_____$)$.
Added by Thomas N.
Close
Step 1
Graph the constraints: - Y < 10: This is a horizontal line at Y = 10, everything below this line is feasible. - 3x + Y < 12: This is a line with a slope of -3 and a y-intercept of 12. Everything below this line is feasible. - 2x + 3y < 12: This is a line with a Show more…
Show all steps
Your feedback will help us improve your experience
Imogen Dell and 95 other Calculus 3 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.
Key Concepts
Recommended Videos
Use the method of this section to solve the linear programming problem. Maximize P = x + 2y subject to 2x + 3y <= 12 -x + 3y = 3 x >= 0, y >= 0 The maximum is P = at (x,y) =
Israel H.
Sri K.
Solve each linear programming problem. $$ \text { Maximize } z=3 x+5 y \text { subject to } x \geq 0, \quad y \geq 0, \quad x+y \geq 2, \quad 2 x+3 y \leq 12, \quad 3 x+2 y \leq 12 $$
Systems of Equations and Inequalities
Linear Programming
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD