Chapter 3: Problem 19
Solve each linear programming problem by the method of corners. $$ \begin{aligned} \text { Minimize } & C=2 x+10 y \\ \text { subject to } & 5 x+2 y \geq 40 \\ & x+2 y \geq 20 \\ & y \geq 3, x \geq 0 \end{aligned} $$
/*! 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 3: Problem 19
Solve each linear programming problem by the method of corners. $$ \begin{aligned} \text { Minimize } & C=2 x+10 y \\ \text { subject to } & 5 x+2 y \geq 40 \\ & x+2 y \geq 20 \\ & y \geq 3, x \geq 0 \end{aligned} $$
All the tools & learning materials you need for study success - in one app.
Get started for free
Find the graphical solution of each inequality. $$ 5 x-3 y \geq 15 $$
Determine graphically the solution set for each system of inequalities and indicate whether the solution set is bounded or unbounded. $$ \begin{array}{r} x+2 y \geq 3 \\ 2 x+4 y \leq-2 \end{array} $$
ADVERTISING As part of a campaign to promote its annual clearance sale, the Excelsior Company decided to buy television advertising time on Station KAOS. Excelsior's advertising budget is \(\$ 102,000\). Morning time costs \(\$ 3000 /\) minute, afternoon time costs \(\$ 1000 /\) minute, and evening (prime) time costs \(\$ 12,000 /\) minute. Because of previous commitments, KAOS cannot offer Excelsior more than 6 min of prime time or more than a total of 25 min of advertising time over the 2 weeks in which the commercials are to be run. KAOS estimates that morning commercials are seen by 200,000 people, afternoon commercials are seen by 100,000 people, and evening com- mercials are seen by 600,000 people. How much morning, afternoon, and evening advertising time should Excelsior buy in order to maximize exposure of its commercials?
MaNUFACTURING-SHIPPING CosTs TMA manufactures 37-in. high-definition LCD televisions in two separate locations, location I and location II. The output at location I is at most 6000 televisions/month, whereas the output at location II is at most 5000 televisions/month. TMA is the main supplier of televisions to Pulsar Corporation, its holding company, which has priority in having all its requirements met. In a certain month, Pulsar placed orders for 3000 and 4000 televisions to be shipped to two of its factories located in city A and city B, respectively. The shipping costs (in dollars) per television from the two TMA plants to the two Pulsar factories are as follows: Find a shipping schedule that meets the requirements of both companies while keeping costs to a minimum.
Determine whether the statement is true or false. If it is true, explain why it is true. If it is false, give an example to show why it is false. An optimal solution of a linear programming problem is a feasible solution, but a feasible solution of a linear programming problem need not be an optimal solution.
What do you think about this solution?
We value your feedback to improve our textbook solutions.