Chapter 6: Problem 2
Find the graphical solution of each inequality. $$3 y+2>0$$
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 6: Problem 2
Find the graphical solution of each inequality. $$3 y+2>0$$
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Solve each linear programming problem by the simplex method. $$ \begin{array}{ll} \text { Maximize } & P=x+2 y-z \\ \text { subject to } & 2 x+y+z \leq 14 \\ & 4 x+2 y+3 z \leq 28 \\ & 2 x+5 y+5 z \leq 30 \\ & x \geq 0, y \geq 0, z \geq 0 \end{array} $$
Everest Deluxe World Travel has decided to advertise in the Sunday editions of two major newspapers in town. These advertisements are directed at three groups of potential customers. Each advertisement in newspaper I is seen by 70,000 group-A customers, 40,000 group-B customers, and 20,000 group-C customers. Each advertisement in newspaper II is seen by 10,000 group-A, 20,000 group-B, and 40,000 group-C customers. Each advertisement in newspaper I costs $$\$ 1000$$, and each advertisement in newspaper II costs $$\$ 800$$. Everest would like their advertisements to be read by at least 2 million people from group A, \(1.4\) million people from group \(\mathrm{B}\), and 1 million people from group C. How many advertisements should Everest place in each newspaper to achieve its advertising goals at a minimum cost? What is the minimum cost?
Solve each linear programming problem by the simplex method. $$ \begin{array}{lc} \text { Maximize } & P=3 x+4 y+5 z \\ \text { subject to } & x+y+z \leq 8 \\ & 3 x+2 y+4 z \leq 24 \\ & x \geq 0, y \geq 0, z \geq 0 \end{array} $$
Solve each linear programming problem by the method of corners. $$ \begin{array}{l} \text { Maximize } P=4 x+2 y \\ \text { subject to } \quad x+y \leq 8 \\ \quad 2 x+y \leq 10 \\ x \geq 0, y \geq 0 \end{array} $$
Solve each linear programming problem by the method of corners. $$ \begin{aligned} \text { Maximize } & P=2 x+5 y \\ \text { subject to } & 2 x+y \leq 16 \\ & 2 x+3 y \leq 24 \\ y & \leq 6 \\ x & \geq 0, y \geq 0 \end{aligned} $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.