Chapter 4: Problem 11
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). $$ x \geq-5 $$
/*! 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 11
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). $$ x \geq-5 $$
All the tools & learning materials you need for study success - in one app.
Get started for free
Solve the LP problems. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. \(\vee\) Minimize \(\quad c=3 x-3 y\) subject to \(\begin{aligned} \frac{x}{4} & \leq y \\ y & \leq \frac{2 x}{3} \\ x+y & \geq 5 \\ x+2 y & \leq 10 \\ x \geq 0, y & \geq 0 \end{aligned}\)
Transportation Scheduling Your publishing company is about to start a promotional blitz for its new book, Physics for the Liberal Arts. You have 20 salespeople stationed in Chicago and 10 in Denver. You would like to fly at most 10 into Los Angeles and at most 15 into New York. A round-trip plane flight from Chicago to LA costs \(\$ 195 ;^{28}\) from Chicago to \(\mathrm{NY}\) costs \(\$ 182 ;\) from Denver to LA costs \(\$ 395 ;\) and from Denver to NY costs \(\$ 166\). You want to spend at most \(\$ 4,520\) on plane flights. How many salespeople should you fly from each of Chicago and Denver to each of \(\mathrm{LA}\) and \(\mathrm{NY}\) to have the most salespeople on the road?
$$ \begin{array}{ll} \text { Minimize } & c=s+3 t+u \\ \text { subject to } & 5 s-t \quad+v \geq 1,000 \\ u-v & \geq 2,000 \\ & \quad s+t \quad \geq 500 \\ & s \geq 0, t \geq 0, u \geq 0, v \geq 0 . \end{array} $$
$$ \begin{array}{rr} \text { Minimize } & c=2 s+t+3 u \\ \text { subject to } & s+t+u \geq 100 \\ 2 s+t & \geq 50 \\ t+u & \geq 50 \end{array} $$
\mathrm{\\{} G a m e ~ T h e o r y ~ - ~ P o l i t i c s ~ I n c u m b e n t ~ T a x ~ \(\mathrm{N}\). Spend and chal- lenger Trick L. Down are running for county executive, and polls show them to be in a dead heat. The election hinges on three cities: Littleville, Metropolis, and Urbantown. The candidates have decided to spend the last weeks before the election campaigning in those three cities; each day each candidate will decide in which city to spend the day. Pollsters have determined the following payoft matrix, where the payoff represents the number of votes gained or lost for each one-day campaign trip. T. N. Spend \begin{tabular}{|l|c|c|c|} \hline & Littleville & Metropolis & Urbantown \\ \hline Littleville & \(-200\) & \(-300\) & 300 \\ \hline Metropolis & \(-500\) & 500 & \(-100\) \\ \hline Urbantown & \(-500\) & 0 & 0 \\ \hline \end{tabular} T. L. Down What percentage of time should each candidate spend in each city in order to maximize votes gained? If both candidates use their optimal strategies, what is the expected vote?
What do you think about this solution?
We value your feedback to improve our textbook solutions.