Stewart Precalc 6e Chapter 10 Focus on Modeling: Linear Programming

16문제

--:--
0 / 16
Stewart Precalc 6e Chapter 10 Focus on Modeling: Linear Programming 0/16
1 Linear Programming - Optimization on Feasible Region · Level 2
Find the maximum and minimum values of the objective function \(M = 200 - x - y\) on the indicated feasible region.
문제 이미지
2 Linear Programming - Optimization on Feasible Region · Level 2
Find the maximum and minimum values of the objective function \(N = \dfrac{1}{2} x + \dfrac{1}{4} y + 40\) on the indicated feasible region.
문제 이미지
3 Linear Programming - Algebraic Constraints · Level 3
Find the maximum and minimum values of the objective function \(P = 140 - x + 3y\) on the feasible region defined by the constraints \(\begin{cases} x \geq 0 \\ y \geq 0 \\ 2x + y \leq 10 \\ 2x + 4y \leq 28 \end{cases}\).
4 Linear Programming - Algebraic Constraints · Level 3
Find the maximum and minimum values of the objective function \(Q = 70x + 82y\) on the feasible region defined by \(\begin{cases} x \geq 0 \\ y \geq 0 \\ x \leq 10 \\ y \leq 20 \\ x + y \geq 5 \\ x + 2y \leq 18 \end{cases}\).
5 Linear Programming - Word Problems · Level 4
A furniture manufacturer makes wooden tables and chairs. The production process involves two basic types of labor: carpentry and finishing. A table requires 2 hours of carpentry and 1 hour of finishing, and a chair requires 3 hours of carpentry and \(\dfrac{1}{2}\) hour of finishing. The profit is \$35 per table and \$20 per chair. The manufacturer's employees can supply a maximum of 108 hours of carpentry work and 20 hours of finishing work per day. How many tables and chairs should be made each day to maximize profit?
6 Linear Programming - Word Problems · Level 4
A housing contractor has subdivided a farm into 100 building lots. She has designed two types of homes for these lots: colonial and ranch style. A colonial requires \$30,000 of capital and produces a profit of \$4000 when sold. A ranch-style house requires \$40,000 of capital and provides an \$8000 profit. If the contractor has \$3.6 million of capital on hand, how many houses of each type should she build for maximum profit? Will any of the lots be left vacant?
7 Linear Programming - Word Problems · Level 4
A trucker hauls citrus fruit from Florida to Montreal. Each crate of oranges is 4 ft³ in volume and weighs 80 lb. Each crate of grapefruit has a volume of 6 ft³ and weighs 100 lb. His truck has a maximum capacity of 300 ft³ and can carry no more than 5600 lb. Moreover, he is not permitted to carry more crates of grapefruit than crates of oranges. If his profit is \$2.50 on each crate of oranges and \$4 on each crate of grapefruit, how many crates of each fruit should he carry for maximum profit?
문제 이미지
8 Linear Programming - Word Problems · Level 4
A manufacturer of calculators produces two models: standard and scientific. Long-term demand for the two models mandates that the company manufacture at least 100 standard and 80 scientific calculators each day. However, because of limitations on production capacity, no more than 200 standard and 170 scientific calculators can be made daily. To satisfy a shipping contract, a total of at least 200 calculators must be shipped every day.
(a) If the production cost is \$5 for a standard calculator and \$7 for a scientific one, how many of each model should be produced daily to minimize this cost?
(b) If each standard calculator results in a \$2 loss but each scientific one produces a \$5 profit, how many of each model should be made daily to maximize profit?

답은 위 문제 본문 각 파트 아래에 직접 입력하세요.

9 Linear Programming - Transportation · Level 4
An electronics discount chain has a sale on a certain brand of stereo. The chain has stores in Santa Monica and El Toro and warehouses in Long Beach and Pasadena. To satisfy rush orders, 15 sets must be shipped from the warehouses to the Santa Monica store, and 19 must be shipped to the El Toro store. The cost of shipping a set is \$5 from Long Beach to Santa Monica, \$6 from Long Beach to El Toro, \$4 from Pasadena to Santa Monica, and \$5.50 from Pasadena to El Toro. If the Long Beach warehouse has 24 sets and the Pasadena warehouse has 18 sets in stock, how many sets should be shipped from each warehouse to each store to fill the orders at a minimum shipping cost?
10 Linear Programming - Transportation · Level 4
A man owns two building supply stores, one on the east side and one on the west side of a city. Two customers order some \(\dfrac{1}{2}\)-inch plywood. Customer A needs 50 sheets, and customer B needs 70 sheets. The east-side store has 80 sheets, and the west-side store has 45 sheets of this plywood in stock. The east-side store's delivery costs per sheet are \$0.50 to customer A and \$0.60 to customer B. The west-side store's delivery costs per sheet are \$0.40 to customer A and \$0.55 to customer B. How many sheets should be shipped from each store to each customer to minimize delivery costs?
11 Linear Programming - Word Problems · Level 4
A confectioner sells two types of nut mixtures. The standard-mixture package contains 100 g of cashews and 200 g of peanuts and sells for \$1.95. The deluxe-mixture package contains 150 g of cashews and 50 g of peanuts and sells for \$2.25. The confectioner has 15 kg of cashews and 20 kg of peanuts available. On the basis of past sales, the confectioner needs to have at least as many standard as deluxe packages available. How many bags of each mixture should he package to maximize his revenue?
12 Linear Programming - Word Problems · Level 4
A biologist wishes to feed laboratory rabbits a mixture of two types of foods. Type I contains 8 g of fat, 12 g of carbohydrate, and 2 g of protein per ounce. Type II contains 12 g of fat, 12 g of carbohydrate, and 1 g of protein per ounce. Type I costs \$0.20 per ounce and type II costs \$0.30 per ounce. The rabbits each receive a daily minimum of 24 g of fat, 36 g of carbohydrate, and 4 g of protein, but get no more than 5 oz of food per day. How many ounces of each food type should be fed to each rabbit daily to satisfy the dietary requirements at minimum cost?
13 Linear Programming - Word Problems · Level 4
A woman wishes to invest \$12,000 in three types of bonds: municipal bonds paying 7% interest per year, bank investment certificates paying 8%, and high-risk bonds paying 12%. For tax reasons she wants the amount invested in municipal bonds to be at least three times the amount invested in bank certificates. To keep her level of risk manageable, she will invest no more than \$2000 in high-risk bonds. How much should she invest in each type of bond to maximize her annual interest yield? [Hint: Let \(x\) = amount in municipal bonds and \(y\) = amount in bank certificates. Then the amount in high-risk bonds will be \(12000 - x - y\).]
14 Linear Programming - Word Problems · Level 4
Refer to Problem 13. Suppose the investor decides to increase the maximum invested in high-risk bonds to \$3000 but leaves the other conditions unchanged. By how much will her maximum possible interest yield increase?
15 Linear Programming - Three-Variable Problems · Level 4
A small software company publishes computer games and educational and utility software. Their business strategy is to market a total of 36 new programs each year, at least four of these being games. The number of utility programs published is never more than twice the number of educational programs. On average, the company makes an annual profit of \$5000 on each computer game, \$8000 on each educational program, and \$6000 on each utility program. How many of each type of software should the company publish annually for maximum profit?
문제 이미지
16 Linear Programming - Conceptual · Level 3
All parts of this problem refer to the following feasible region and objective function: \(\begin{cases} x \geq 0 \\ x \geq y \\ x + 2y \leq 12 \\ x + y \leq 10 \end{cases}\) and \(P = x + 4y\).
(a) Graph the feasible region.
(b) On your graph from part (a), sketch the graphs of the linear equations obtained by setting \(P\) equal to 40, 36, 32, and 28.
(c) If you continue to decrease the value of \(P\), at which vertex of the feasible region will these lines first touch the feasible region?
(d) Verify that the maximum value of \(P\) on the feasible region occurs at the vertex you chose in part (c).

답은 위 문제 본문 각 파트 아래에 직접 입력하세요.

답변 완료: 0 / 16