Question
In Problems 9–18, solve each linear programming problem.$$\text { Maximize } z=2 x+y \quad \text { subject to } \quad x \geq 0, \quad y \geq 0, \quad x+y \leq 6, \quad x+y \geq 1$$
Step 1
The constraints \(x+y \leq 6\) and \(x+y \geq 1\) can be rewritten as \(y \leq -x + 6\) and \(y \geq -x + 1\) respectively. Show more…
Show all steps
Your feedback will help us improve your experience
Rae Xin and 71 other Algebra 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
In Problems 9–18, solve each linear programming problem. $$ \text { Maximize } z=2 x+4 y \quad \text { subject to } \quad x \geq 0, \quad y \geq 0, \quad 2 x+y \geq 4, \quad x+y \leq 9 $$
Systems of Equations and Inequalities
Linear Programming
In Problems 9–18, solve each linear programming problem. $$ \text { Maximize } z=5 x+3 y \text { subject to } x \geq 0, \quad y \geq 0, \quad x+y \geq 2, \quad x+y \leq 8, \quad 2 x+y \leq 10 $$
In Problems 9–18, solve each linear programming problem. $$ \text { Maximize } z=5 x+2 y \text { subject to } x \geq 0, \quad y \geq 0, \quad x+y \leq 10, \quad 2 x+y \geq 10, \quad x+2 y \geq 10 $$
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD