Chapter 4: Problem 48
Explain the advantage of shading the region of points that do not satisfy the given inequalities. Illustrate with an example.
/*! 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 48
Explain the advantage of shading the region of points that do not satisfy the given inequalities. Illustrate with an example.
All the tools & learning materials you need for study success - in one app.
Get started for free
Politics The political pollster Canter is preparing for a national election. It would like to poll at least 1,500 Democrats and 1,500 Republicans. Each mailing to the East Coast gets responses from 100 Democrats and 50 Republicans. Each mailing to the Midwest gets responses from 100 Democrats and 100 Republicans. And each mailing to the West Coast gets responses from 50 Democrats and 100 Republicans. Mailings to the East Coast cost \(\$ 40\) each to produce and mail, mailings to the Midwest cost \(\$ 60\) each, and mailings to the West Coast cost \(\$ 50\) each. How many mailings should Canter send to each area of the country to get the responses it needs at the least possible cost? What will it cost?
Solve the LP problems. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. \(\begin{aligned} \text { Maximize } & p=2 x+3 y \\ \text { subject to } & 0.1 x+0.2 y \geq 1 \\ & 2 x+\quad y \geq 10 \\ & x \geq 0, y \geq 0 . \end{aligned}\)
Can the following linear programming problem be stated as a standard maximization problem? If so, do it; if not, explain why. \(\begin{array}{ll}\text { Maximize } & p=3 x-2 y \\ \text { subject to } & x-y+z \geq 0 \\ & x-y-z \leq 6 \\ & x \geq 0, y \geq 0, z \geq 0 .\end{array}\) 28 Prices from Travelocity, at www.travelocity.com, for the week of June 3,2002 , as of May 5,2002 .
Solve the LP problems. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. \(\vee\) Minimize \(c=-x+2 y\) subject to \(\begin{aligned} y & \leq \frac{2 x}{3} \\\ x & \leq 3 y \\ y & \geq 4 \\ x & \geq 6 \\ x+y & \leq 16 . \end{aligned}\)
$$ P=\left[\begin{array}{rrr} -1 & 1 & 2 \\ 2 & -1 & -2 \\ 1 & 2 & 0 \end{array}\right] $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.