Wk #11 Alg2H Chapter 4 Review Sheet

Alg2H
Chapter 4 Review Sheet
x  2 z  13
1) 2 x  y  8
 2 y  9 z  41
4)
2)
Wk #11
Date ______
6 7
 8
x y
3)
15 14
  21
x
y
5 x  2 y  20
3x  7 y  21
2 x  y  3z  7
 x  3 y  2 z  13
3x  4 y  5 z  20
f ( x)  2 x  5
Let g ( x)  7  3 x
h( x )  4  3 x  x 2
5)
f (h(2))
6)
h(g (1))
7)
f ( f (2))
8)
g ( f (5))
9)
h( g ( x))
10)
h(3)
11)
f ( g ( x))
12)
g (4  a)
1
13) Hamburger Problem
Wk #11
Sue Flay and Cassa Roll obtain a franchise to operate a hamburger stand for a well – known national hamburger
chain. They pay $20,000 for the franchise, and have additional expenses of $250 per thousand hamburgers they sell.
They sell the hamburgers for $.75 each, so they take in revenue of $750 per thousand burgers.
(a) Let r(x) be the number of dollars revenue they take in by selling x thousand burgers. Write the particular
equation.
(b) Find r(20), r(50), and r(0)
(c) Let c(x) be the total cost of owning the hamburger stand, including the $20,000 franchise fee. Write the
particular equation for function c.
(d) Find c(20), c(50), and c(0)
(e) Sketch the graphs of r and c on the same set of axes. Have they crossed by the time x is 50?
(f) How many burgers must Sue and Cassa sell in order to break even?
5 x  4 y  6 z  21
14)  2 x  3 y  4 z  15
3x  7 y  5 z  15
6x  y  2z  7
15) 5 x  4 y  5 z  5
x  3 y  3z  4
16) Write a set of inequalities that describes the shaded region. (Note: The lines are labeled 1, 2, 3, 4)
3
4
(-6,12)
(0,10)
(15, 10)
1
(-6,4)
(12,0)
2
2
Wk #11
17.
CB Radio Manufacturing Problem Suppose you work for a small company that makes high-quality CB
radios. They wish to optimize the numbers of the two models they produce, “Good Buddies” and “Breakers”, in
order to maximize their profit. Since you are an expert at linear programming, your boss assigns you the job.
You find the following information:
i. The assembly lines can produce no more than 16 Good Buddies and 25 Breakers per day.
ii. No more than 32 radios, total, can be produced per day.
iii. They can spend a total of no more than 189 man-hours a day assembling radios. It takes 3 man-hours to
assemble a Good Buddy and 7 man-hours to assemble a Breaker.
iv. They can spend at most 68 man-hours per day, total , testing radios. It takes 4 man-hours to test a Good Buddy
and 1 man-hour to test a Breaker.
v. The number of Breakers produced per day must be more than half the number of Good Buddies.
Using this information, answer the following questions:
a. Define the variables. (Let the independent variable be the Good Buddies so everyone has the same graph)
b. If the company makes a profit of $20 on each Good Buddy and $40 on each Breaker, write an equation
expressing dollars profit earned per day in terms of the numbers of Good Buddies and Breakers produced each
day. (Objective Function)
c. Write the set of inequalities (Constraints) for each of the requirements i-v above.
18. Continue problem 17:
d. On graph paper, plot the graph of the feasible region. Use highlighter to shade the feasible region.
e. Label the corner points of the feasible region with letters. Determine all the exact coordinates of each point.
f. Shade the portion of the feasible region in which the daily profit is at least $960.
g. Find the optimum point at which the daily profit is a maximum, and the number of dollars they would earn per
day by operating at this point.
3
Solutions to Wk #11
Solutions to Chapter 4 Review Sheet Wk#11
1.
(3,2,5)
2.
 182  45 
,


 41 41 
3.
3 7
 , 
5 2
7.
 23
4. Dependent---consistent (all pts on line)
5.
 17
6.
9.
 9 x 2  51x  66
10. 4
 24
11.
 6x  9
8.
12.
52
3a  5
13.
14.
 1,1,5
15. No solution --- inconsistent (independent) Be sure to show algebraically!!!
1
1) y   x  10
3
2
2) y   x
16.
3
3) x  6
10
4) y  x  40
3
4
solutions to Wk
Solution #17-18
#11
a. Let x = # Good Buddies produced per day
Let y = # Breakers produced per day
Let P = # dollars profit per day
b. MAX: P = 20x + 40y
c. Subject to:
1) x > 0
2) y > 0
3) x < 16
4) y < 25
or
0 < x < 16
0 < y < 25
5) x + y < 32
6) 3x + 7y < 189
7) 4x + y < 68
8) y > ½ x
5