Chapter 4: Problem 6
Sketch the region that corresponds to the given inequalities, say whether the region is bounded or unbounded, and find the coordinates of all corner points (if any). $$ 2 x-3 y \leq 7 $$
/*! 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 4: Problem 6
Sketch the region that corresponds to the given inequalities, say whether the region is bounded or unbounded, and find the coordinates of all corner points (if any). $$ 2 x-3 y \leq 7 $$
All the tools & learning materials you need for study success - in one app.
Get started for free
We suggest the use of technology. Round all answers to two decimal places. Minimize \(c=5.45 x+y+1.5 z+w\) subject to \(\quad 5.12 x-y \quad+w \geq 1,000\) \(z+w \geq 2,000\) \(\quad 1.12 x+y \quad \leq 500\) \(\quad x \geq 0, y \geq 0, z \geq 0, w \geq 0 .\)
Each serving of Gerber Mixed Cereal for Baby contains 60 calories and no vitamin \(C\). Each serving of Gerber Mango Tropical Fruit Dessert contains 80 calories and 45 percent of the U.S. Recommended Daily Allowance (RDA) of vitamin \(\mathrm{C}\) for infants. Each serving of Gerber Apple Banana Juice contains 60 calories and 120 percent of the U.S. RDA of vitamin \(\mathrm{C}\) for infants. \(^{42}\) The cereal costs \(10 \mathrm{~d} /\) serving, the dessert costs \(53 \mathrm{~d} /\) serving, and the juice costs 27 d/serving. If you want to provide your child with at least 120 calories and at least 120 percent of the U.S. RDA of vitamin \(\mathrm{C}\), how can you do so at the least cost? What are your shadow costs for calories and vitamin \(\mathrm{C}\) ?
Why is the simplex method useful? (After all, we do have the graphical method for solving LP problems.)
$$ \begin{array}{ll} \text { Maximize } & p=x+5 y \\ \text { subject to } & x+y \leq 6 \\ & -x+3 y \leq 4 \\ & x \geq 0, y \geq 0 . \end{array} $$
Your other friend Jason is telling everyone that if there is only one constraint in a standard linear programming problem, then you will have to pivot at most once to obtain an optimal solution. Is he correct? Explain.
What do you think about this solution?
We value your feedback to improve our textbook solutions.