Upload
others
View
2
Download
0
Embed Size (px)
Citation preview
© 2010 Chung Tai Educational Press. All rights reserved.
Chapter 1 Development of Number Systems
Chapter 2 Quadratic Equations in One Unknown
Chapter 3 Introduction to Functions
Chapter 4 Graphs of Quadratic Functions
Chapter 5 Variations
Chapter 6 More about Polynomials
Chapter 7 More about Inequalities
Chapter 8 Linear Programming
Chapter 9 More about Trigonometry
Chapter 10 Exponential Functions
Chapter 11 Logarithmic Functions
Chapter 12 More about Equations
Chapter 1 Basic Properties of Circles (I)
Chapter 2 Basic Properties of Circles (II)
Chapter 3 Measures of Dispersion (I)
Chapter 4 Measures of Dispersion (II)
Chapter 5 Permutations and Combinations
Chapter 6 More about Probability
Chapter 7 Locus
Chapter 8 Equations of Straight Lines
Chapter 9 Equations of Circles
Chapter 10 More about Graphs of Functions
Chapter 11 Transformation of Graphs of Functions
Chapter 1 Arithmetic Sequences
Chapter 2 Geometric Sequences
Chapter 3 More about Applications of Trigonometry
Chapter 4 More about Use and Misuse of Statistics
8.1
© 2009 Chung Tai Educational Press. All rights reserved.
1. Shade the region which represents the graphical solution of each of the following inequalities.
(a) 1+≥ xy (b) 22 <+ yx
O
1
y
−3 1 2 3x
3
2
−3
−2
−2 −1
y = x + 1
−1
O
1
−3
y
−3 1 2 3x
3
2
−2
−1−2 −1
x + 2y = 2
2. In each of the following, the shaded region represents the graphical solution of an inequality. Write down the inequality.
(a)
O
1
−3
y
−3 1 2 3x
3
2
−2
−1−2 −1
y = x − 2
(b)
O
1
−3
y
−3 1 2 3x
3
2
−2
−1−2 −1
3x + y = −3
The inequality is . The inequality is .
�
The point (0, 0) can be used to perform a test.
8.2
© 2009 Chung Tai Educational Press. All rights reserved.
3. Solve the following inequalities graphically.
(a) 1−≥+ yx (b) 1≤− yx
1−=+ yx 1=− yx
x 0 1 2 x 0 1 2
y y
The graphical solution of 1−≥+ yx The graphical solution of 1≤− yx is as follows. is as follows.
O
2
1
−1
−2
−3
3
y
−1−2−3 1 2 3x
O
2
1
−1
−2
−3
3
y
−1−2−3 1 2 3x
(c) 12 >+ yx (d) 12 <− yx
12 =+ yx 12 =− yx
x −1 1 3 x 0 1 2
y y
The graphical solution of 12 >+ yx The graphical solution of 12 <− yx is as follows. is as follows.
O
2
1
−1
−2
−3
3
y
−1−2−3 1 2 3x
O
2
1
−1
−2
−3
3
y
−1−2−3 1 2 3x
8.3
© 2009 Chung Tai Educational Press. All rights reserved.
1. In each of the following, use arrows to indicate the graphical solution of each inequality on the same rectangular coordinate plane, then shade the region which represents the graphical solution of the system of inequalities.
(a) ���
≤+≥
32yx
x (b)
���
−−<+≥
12
xyxy
O
1
y
1 3 4x
3
2
−2
−1
x = 2
2
x + y = 3
O
1
y
−4 1 2x
3
2
−2
−1−3 −1
y = −x − 1
−2
y = x + 2
2. In each of the following, the shaded region / dots represent(s) the graphical solution of a system of inequalities. Write down the system of inequalities.
(a)
O
1
y
1 3 4x
3
2
−2
−1−2 −1
2x + 3y = 6
2
x = 3
y = 2
(b)
O
1
y
1 4 5x
−4
−3
−1
y = −x + 3
2
y = −2−2
−13
y = x − 3
The system of inequalities is The system of inequalities is
���
�
���
�
�
.
���
�
���
�
�
era dna
yx
.
�
The overlapping region of the graphical solutions of the inequalities is the graphical solution of the system of inequalities.
8.4
© 2009 Chung Tai Educational Press. All rights reserved.
3. Solve the following systems of inequalities graphically.
(a) ���
<−≤+
225
yxyx
(b)
���
���
�
≤≤
>+
sregetni era dna 32
42
yxy
yxyx
5=+ yx 42 =+ yx
x 0 2 5 x 0 2 4
y y
22 =− yx yx 2=
x 0 2 4 x 0 2 4
y y
The graphical solution of
���
<−≤+
225
yxyx
The dots in the following graph represent the
is as follows.
graphical solution of
���
���
�
≤≤
>+
sregetni era dna 32
42
yxy
yxyx
.
O
2
1
−2
y
−2 1 2 5 6x
3 4
3
4
−1−1
1O
2
1
−1
5
6
y
−1 2 5 6x
3 4
3
4
8.5
© 2009 Chung Tai Educational Press. All rights reserved.
1. A shop sells two types of barbecue food sets, A and B. The number of chicken wings and number of sausages in each set A and each set B are as follows.
Chicken wing Sausage
Set A 6 4
Set B 5 9
It is given that Ken requires at least 50 chicken wings and at most 80 sausages. If x sets A and y sets B are to be bought, write down all the constraints about x and y.
The constraints are
���
�
���
�
�
.
2. A carpenter is going to use at most 150 units of wood and 180 working hours to make x wardrobes and y beds. It is given that making a wardrobe requires 15 units of wood and 12 working hours, while making a bed requires 10 units of wood and 15 working hours.
(a) Write down all the constraints about x and y.
The constraints are
���
�
���
�
�
,
8.6
© 2009 Chung Tai Educational Press. All rights reserved.
which are equivalent to
���
�
���
�
�
.
(b) Represent the feasible solutions on a rectangular coordinate plane.
O
21
y
1 2 15 16x
3 4
1516
−1−1
1314
1112
910
78
56
34
13 1411 129 107 85 6
The ordered pairs representing all points with integral coordinates in the shaded region represent all feasible solutions.
8.7
© 2009 Chung Tai Educational Press. All rights reserved.
1. In each of the following, the shaded region / dots represent(s) the feasible solutions of certain constraints. If ) ,( yx is any point in the feasible region, find the maximum and minimum values of
) ,( yxf .
(a) yxyxf += 2) ,(
O
21
y
1 2x
3 4−1−1
7
56
34
75 62x + y = 0
From the graph,
) ,( yxf attains its maximum / minimum values at the points ) , ( and ) , ( .
At the point ) , ( ,
) () (2) , (
=
+=f
At the point ) , ( ,
) () (2) , (
=
+=f
∴ Maximum value =
Minimum value =
8.8
© 2009 Chung Tai Educational Press. All rights reserved.
(b) yxyxf 3) ,( −=
−3 O
21
y
1 2x
3 4
−4
−4
34
x − 3y = 0
−3−2−1−2 −1
From the graph,
) ,( yxf attains its maximum / minimum values at the points ) , ( and ) , ( .
At the point ) , ( ,
) , (
=
=f
At the point ) , ( ,
) , (
=
=f
∴ Maximum value =
Minimum value =
(c) 2) ,( −+= yxyxf
−5 O
21
y
1 2x
−6
x + y − 2 = 0
−2−1−2 −1
−4−3
−3−4
8.9
© 2009 Chung Tai Educational Press. All rights reserved.
From the graph,
) ,( yxf attains its maximum / minimum values at the points ) , ( and ) , ( .
At the point ) , ( ,
) , (
=
=f
At the point ) , ( ,
) , (
=
=f
∴ Maximum value =
Minimum value =
2. (a) Draw the feasible region which represents the following constraints on a rectangular coordinate
plane.
��
��
�
≤−−≥−
≤+
6262
6
yxyx
yx
O
5
1
−7
y
−7 1 2x
3 7
67
−1−1
234
5 64−6 −5 −4 −3 −2
−6−5−4−3−2
The shaded region in the graph is the feasible region.
8.10
© 2009 Chung Tai Educational Press. All rights reserved.
(b) Using the result of (a), find the maximum and minimum values of yxyxf 23) ,( −= subject to the above constraints.
Consider the vertices ) , ( , ) , ( and ) , ( of the feasible region.
At the point ) , ( ,
) , (
=
=f
At the point ) , ( ,
) , (
=
=f
At the point ) , ( ,
) , (
=
=f
∴ Maximum value =
Minimum value =
3. A company is going to spend at most $120 000 and 720 man-hours to produce x items A and y items B. The details of producing an item A and an item B are as follows.
Item A Item B
Cost ($) 600 480
Production time (hour) 3 4
(a) Write down all the constraints about x and y.
The constraints are
���
�
���
�
�
,
8.11
© 2009 Chung Tai Educational Press. All rights reserved.
which are equivalent to
���
�
���
�
�
.
(b) Represent the feasible solutions on a rectangular coordinate plane.
y
xO
200
50 100 250
250
150 200
50
150
100
300
300
The ordered pairs representing all points with integral coordinates in the shaded region represent all feasible solutions.
8.12
© 2009 Chung Tai Educational Press. All rights reserved.
(c) If the profits of selling an item A and an item B are $400 and $500 respectively, how many items A and items B should the company produce to obtain the maximum profit?
Total profit
$
) $() ,($
=
+= yxyxP
Draw a straight line , i.e. the straight line on the
graph in (b).
From the graph, the profit is the maximum when =x and =y .
∴ The company should produce items A and items B.
8.13
© 2009 Chung Tai Educational Press. All rights reserved.
Shade the region which represents the graphical solution of each of the following inequalities. 1. (a) 4≥+ yx (b) 623 +< xy
O
21
−2
y
−2 1 2 5x
3 4
45
−1−1
3x + y = 4
O
21
−2
y
−4 1 2x
45
−1−3
3
3y = 2x + 6
−2 −1
In each of the following, the shaded region represents the graphical solution of an inequality. Write down the inequality. 2. (a)
O
21
−2
y
−2 1 2 5x
3 4
45
−1−1
3
−x + 2y = 5 (b)
O
21
−2
y
−2 1 2 5x
3 4
45
−1−1
33x + 4y = 12
Use shaded region / dots to represent the graphical solution of each of the following systems of inequalities. (3 − 4)
3. (a) ���
≤+−≥
23
yxxy
(b) ��
��
�
≤<−−
>+
2063
02
yyxyx
O
21
y
1 2x
5 6
−4
34
x + y = 2
−3−2−1−2 −1
y = x − 3
3 4
−3 O
21
y
1 2x
3 4
−4
−4
34
3x − y − 6 = 0
−3−2−1−2 −1
2x + y = 0
y = 2
8.14
© 2009 Chung Tai Educational Press. All rights reserved.
4. (a)
���
���
�
≥≥
≤+
sregetni era dna 11
4
yxyx
yx
(b)
���
���
�
<+≤−−>
sregetni era dna 0
223
yxx
xyxy
O
21
y
1 2x
4 6
3
5
−2
−1
x + y = 4
y = 1
x = 1
4
−1 3 5
−5 O
21
y
1x
−4
−6
3y = −x − 3
−3−2−1−2 −1
2y = x + 2
−3−4
In each of the following, the shaded region / dots represent(s) the graphical solution of a system of inequalities. Write down the system of inequalities. (5 − 6)
5. (a)
−3 O
21
y
1 2x
3 4
34
y = x + 2−3−2−1−2 −1
x + y = 0
x = 2
(b)
O
21
y
1 2x
5 6
3
5
y = x + 1
−2−1−2
2y = x − 5y = −1
4
3 4
5x + 6y = 30
−1
6. (a)
−4 O
21
y
1 2x
3
34x + y = 2
−3−2−1−2 −1
−x + 2y = 2
y = −1−3
(b)
−5 O
21
y
1 2x
3
562x + 3y = 6
−1−2 −1
−4x + 5y = 20
−3
34
−4
8.15
© 2009 Chung Tai Educational Press. All rights reserved.
7. In the figure, the shaded region represents the graphical solution of an inequality.
O
y
x
4y = 7x + 14
(a) Write down the inequality.
(b) Determine whether the following ordered pairs are solutions of the inequality. (i) (3, 9) (ii) (−2, 0) (iii) (−3, −2)
Solve the following inequalities graphically. (8 − 11)
8. 62 ≤+ yx 9. 044 ≥−− yx
10. 1025 >− yx 11. 223
<+ yx
12. In the figure, the shaded region is bounded by three inequalities.
O
21
y
1 2x
7 8
3
5
x − y = 1
−2−1−1
x + 2y = 8
4
3 4 5 6
x − 3y = 3
(a) Write down the three inequalities.
(b) List all integral solutions satisfying the three inequalities.
8.16
© 2009 Chung Tai Educational Press. All rights reserved.
Solve the following systems of inequalities graphically. (13 − 20)
13. ���
≥≤+
122
yyx
14. ���
<>−−
4055
xyx
15. ���
≤+≥−
1535632
yxyx
16. ���
>+−≤−+0620432
yxyx
17. ��
��
�
≤<≤+<−
5212406
xyxyx
18. ��
��
�
≤−+≤−
≥+−
04233
063
yxyxyx
19.
���
�
���
�
�
<≤
<+
≥+
sregetni era dna 63
23
1234
yxx
yxyx
20.
���
�
���
�
�
−>−≥
≤++−<
sregetni era dna 21
844
yxyx
yxxy
21. In the figure, the shaded region represents the graphical solution of an inequality.
O
21
y
1 2x
3
6
−1−3
2x − 3y = −5
4
3 4 5
5
−2 −1
(a) Write down the inequality.
(b) If (3, k) is a solution of the inequality where k is a real number, find the smallest integral value of k by referring to the figure.
8.17
© 2009 Chung Tai Educational Press. All rights reserved.
22. In the figure, the shaded region represents the graphical solution of an inequality.
O
21
y
1 2x
3
−32x + 3y = 6
4
3 6 7−1 4 5
−2−1
(a) Write down the inequality.
(b) If (p, −2) is not a solution of the inequality where p is a real number, find the greatest integral value of p by referring to the figure.
23. (a) Solve the system of inequalities
��
��
�
≥+≥+
<+
9382
7
yxyx
yx graphically.
(b) Hence list all integral solutions of the system of inequalities.
24. (a) Solve the system of inequalities
���
���
�
≤<−
≥+>+
31
632623
yyx
yxyx
graphically.
(b) Hence list all integral solutions of the system of inequalities.
25. (a) Solve the system of inequalities
���
≥+<+1
42yx
yx graphically.
(b) Let k be a real number. If the system of inequalities
��
��
�
≤≥+
<+
kxyx
yx1
42 has only 9 integral solutions, find
the smallest integral value of k.
8.18
© 2009 Chung Tai Educational Press. All rights reserved.
26. (a) Solve the system of inequalities
��
��
�
≥−<+
≤−
045
1032
yxyx
yx graphically.
(b) It is given that (1, −1) and (3, 1) both satisfy the system of inequalities
���
���
�
<<≥−
<+≤−
kyhyx
yxyx
045
1032
, where h and
k are real numbers.
(i) Find the greatest integral value of h. (ii) Find the smallest integral value of k. (iii) At least how many integral solutions does the system of inequalities have?
27. Iris is organizing a birthday party and she is going to buy x L of cola and y L of orange juice according to the following constraints.
I. The total capacity of cola and orange juice should not be less than 10 L.
II. The total capacity of cola should be at least twice that of orange juice.
Write down all the constraints about x and y.
28. A factory is going to produce x toys P and y toys Q. The details of producing a toy P and a toy Q are as follows.
Material required (unit) Production time (hour)
Toy P 6 2
Toy Q 3 5
Given that there are 1 200 units of materials and 600 working hours available, write down all the constraints about x and y.
8.19
© 2009 Chung Tai Educational Press. All rights reserved.
29. There are 480 apples, 240 mangoes and 300 oranges available in a fruit shop, and a shopkeeper is going to sell the fruits by packing them into fruit baskets A and fruit baskets B. The details of each type of fruit basket are as follows.
Apple Mango Orange
Fruit basket A 8 4 6
Fruit basket B 6 8 4
If x fruit baskets A and y fruit baskets B are to be produced, write down all the constraints about x and y.
30. A restaurant provides two types of soup, vegetable soup and seafood soup, each day. It is given that
the cost of each litre of vegetable soup and each litre of seafood soup are $5 and $10 respectively, and the restaurant prepares x L of vegetable soup and y L of seafood soup each day according to the following constraints.
I. The total cost of preparing the two types of soup each day should not be more than $600. II. At most 80 L of soup should be prepared each day.
(a) Write down all the constraints about x and y. (b) Represent the feasible solutions on a rectangular coordinate plane.
31. A grocery store sells toothpaste and toothbrushes in two types of packages, family set and economy set. The details of each type of package are as follows.
Number of tubes of toothpaste Number of toothbrushes
Family set 2 4
Economy set 4 6
Tommy wants to buy at least 20 tubes of toothpaste and 36 toothbrushes as gifts of an oral health promotional event. If x family sets and y economy sets are to be bought,
(a) write down all the constraints about x and y. (b) represent the feasible solutions on a rectangular coordinate plane.
32. A beverage shop has 900 pears and 600 apples available to prepare x jars of special drink A and y jars of special drink B. It is given that preparing a jar of special drink A requires 3 pears and 1 apple, while preparing a jar of special drink B requires 2 pears and 3 apples.
(a) Write down all the constraints about x and y. (b) Represent the feasible solutions on a rectangular coordinate plane.
8.20
© 2009 Chung Tai Educational Press. All rights reserved.
33. An ice-cream shop provides two types of dessert sets, A and B. The details of each type of dessert sets are as follows.
Green tea ice-cream (mL)
Chocolate ice-cream (mL)
Mango ice-cream (mL)
Dessert set A 100 100 100
Dessert set B 100 200 0
It is given that at most 40 L of green tea ice-cream, 50 L of chocolate ice-cream and 28 L of mango ice-cream are available for preparing dessert set A and dessert set B each week. If x dessert sets A and y dessert sets B are prepared each week,
(a) write down all the constraints about x and y.
(b) represent the feasible solutions on a rectangular coordinate plane.
34. There are 1 600 units of chemicals A, 1 800 units of chemicals B and 1 500 units of chemicals C available in a laboratory for producing x mL of vaccine P and y mL of vaccine Q. The details of 1 mL of vaccine P and 1 mL of vaccine Q are as follows.
Chemical A (unit) Chemical B (unit) Chemical C (unit)
Vaccine P 4 6 4
Vaccine Q 5 4 5
(a) Write down all the constraints about x and y.
(b) Represent the feasible solutions on a rectangular coordinate plane.
35. An organization is going to invite x male guests and y female guests to a ball. The number of souvenirs and the amounts of food and drink prepared for each male guest and each female guest are as follows.
Souvenir Fruit tart Champagne (glass)
Male guest 1 3 2
Female guest 1 2 1
It is given that the organization has prepared 100 souvenirs, 240 fruit tarts and 150 glasses of champagne.
(a) Write down all the constraints about x and y.
(b) Represent the feasible solutions on a rectangular coordinate plane.
8.21
© 2009 Chung Tai Educational Press. All rights reserved.
36. The owner of a pet shop is going to use at most $9 000 to buy some cats and dogs. Due to the limitation of space, the pet shop can only hold at most 45 cats and dogs in total, and the number of dogs should not be more than that of cats. It is given that the cost of each cat and each dog are $180 and $300 respectively.
(a) Write down all the constraints about the number of cats and the number of dogs to be bought. (b) Represent the feasible solutions on a rectangular coordinate plane.
37. A factory produces digital video discs (DVD) and video compact discs (VCD). For a box of DVD, $7 are spent on materials and $3 on packaging. For a box of VCD, $3 are spent on materials and $2 on packaging. It is given that the material cost and packaging cost of producing the two types of discs each hour should not be more than $2 100 and $1 200 respectively, and the number of boxes of DVDs produced each hour should not be more than 1.5 times that of VCDs.
(a) Write down all the constraints about the number of boxes of DVDs and the number of boxes of VCDs produced each hour.
(b) Represent the feasible solutions on a rectangular coordinate plane.
38. A train provides at most 240 m2 of floor area for passengers and carries at most 3 200 kg of luggage. There are two types of seats available, first-class seats and economy-class seats, where each of them occupies 3 m2 and 1.6 m2 of floor area respectively. It is given that the number of first-class seats
should be less than
41
of the number of economy-class seats, and at most 64 kg and 20 kg of luggage is
allowed for each passenger taking first-class seat and economy-class seat respectively.
(a) Write down all the constraints about the number of first-class seats and the number of economy-class seats provided.
(b) Represent the feasible solutions on a rectangular coordinate plane.
39. A factory has 300 kg of white rice, 175 kg of red rice and 250 kg of brown rice available to produce two rice mixtures A and B. The details of each kg of mixture A and mixture B are as follows.
White rice (g) Red rice (g) Brown rice (g)
Mixture A 625 250 125
Mixture B 250 250 500
It is given that the amount of mixture B produced should not be more than twice that of mixture A, and the amount of mixture B produced should be at least 200 kg.
(a) Write down all the constraints about the amount of mixture A and mixture B to be produced. (b) Represent the feasible solutions on a rectangular coordinate plane.
8.22
© 2009 Chung Tai Educational Press. All rights reserved.
In each of the following, if (x, y) is any point in the shaded region, find the values of x and y such that ) ,( yxf attains its maximum and minimum values. (40 − 41)
40. yxyxf −=) ,( 41. yxyxf 2) ,( +=
O
21
y
1 2x
56
3 6−1 4 5−1
34
O
−3
y
−4x
In each of the following, the shaded region / dots represent(s) the feasible solutions of certain constraints. If (x, y) is any point in the feasible region, find the maximum and minimum values of ) ,( yxf . (42 − 45)
42. yxyxf 2) ,( −= 43. yxyxf −= 2) ,( y
xO
−1
1
1−1 2
−2
−5 O
21
y
1 2x
3
56
−2−1−2 −1−3−4
34
44. yxyxf 3) ,( −= 45. yxyxf 23) ,( +=
4
O
y
x
(6, −2)(−3, −2)
x−6
y
O
1
(−6, −2) (2, −4)
8.23
© 2009 Chung Tai Educational Press. All rights reserved.
Find the maximum and minimum values of ) ,( yxf subject to each of the following constraints. (46 − 51)
46. ��
��
�
≤−≤−
−≥−
51134
174
yyx
yx 47.
���
���
�
≤−≤+
≥++≥++
0401
01030102
yx
yxyx
yxyxf −=) ,( yxyxf 32) ,( −=
48. ��
��
�
≤−≤+
−≥−
923
33
yxyxyx
49. ��
��
�
≤−+≥+−
≤−−
019320423
035
yxyx
yx
235) ,( +−= yxyxf 523) ,( −+= yxyxf
50.
���
���
�
−<+−≥+
≤−
sregetni era dna 33173
62
yxyxyxyx
51.
���
���
�
<−−>++<−+
sregetni era dna 02323
023034
yxyx
yxyx
yxyxf −= 2) ,( 1843) ,( −+= yxyxf
52. (a) Draw the feasible region which represents the following constraints on a rectangular coordinate
plane.
���
���
�
−≥≤
≤+−≥−
15
632
yx
yxyx
(b) Using the result of (a), find the maximum and minimum values of yxyxf 2) ,( += subject to the above constraints.
(c) If an additional constraint 3≤+ yx is added, find the maximum and minimum values of ) ,( yxf .
8.24
© 2009 Chung Tai Educational Press. All rights reserved.
53. (a) Draw the feasible region which represents the following constraints on a rectangular coordinate plane.
���
�
���
�
�
≥≤
≤−+>−+
sregetni evitagen-non era dna 17
012303065
yxyx
yxyx
(b) Using the result of (a), find the maximum and minimum values of 334) ,( +−= yxyxf subject to the above constraints.
(c) If the constraint 7≤x is removed, find the maximum and minimum values of ) ,( yxf .
54. In the figure, the shaded region is bounded by the following four straight lines.
5:
030:
20:
0454:
4
3
2
1
=
=−+
=
=−+
yL
yxL
xL
yxL
(a) Write down the system of inequalities with the shaded region as its graphical solution.
(b) Let 2032 +−= yxP , where (x, y) is any point in the shaded region.
(i) Find the maximum and minimum values of P.
(ii) If 030 ≥−P , find the range of values of y by adding a suitable straight line in the figure.
55. In the figure, R is the region bounded by the following four straight lines.
0932:
03:
01352:
072:
4
3
2
1
=−−
=++
=+−
=−−
yxL
yxL
yxL
yxL
(a) Find the coordinates of A, B, C and D.
(b) Find the maximum and minimum values of 423 +− yx , where (x, y) is any point in the region R.
y
xO
10
5 10 20 2515
5
20
15
25
L3
L2L1
L4
x
y
L1
L2
L3
L4
A
B
CDO
R
8.25
© 2009 Chung Tai Educational Press. All rights reserved.
56. A factory is going to produce x items A and y items B. The details of producing an item A and an item B are as follows.
Item A Item B
Material cost ($) 80 120
Production time (hour) 20 20
Given that there are $7 200 available for the materials and 1 400 working hours,
(a) write down all the constraints about x and y.
(b) represent the feasible solutions on a rectangular coordinate plane.
(c) If the profits of selling an item A and an item B are $300 and $350 respectively, how many items of each type should the factory produce to obtain the maximum profit?
57. Jacky is organizing a party and he is going to buy x packs of chocolate in package A and y packs of chocolate in package B. The table below shows the details of a pack of chocolate in each package.
Number of pieces of chocolate with nuts
Number of pieces of milk chocolate
Package A 8 8
Package B 4 12
Given that at least 40 pieces of chocolate with nuts and 48 pieces of milk chocolate are required in the party,
(a) write down all the constraints about x and y.
(b) represent the feasible solutions on a rectangular coordinate plane.
(c) If the selling prices of a pack of chocolate in package A and package B are $36 and $21.6 respectively, how many packs of chocolate in each package should Jacky buy to minimize the expenditure?
58. A coordinator is going to take 240 performers to the performance venue by hiring x coaches A and y coaches B. It is given that each coach A can carry 16 passengers and each coach B can carry 48 passengers, and the coach hire company can arrange at most 8 drivers and 3 coaches A.
(a) Write down all the constraints about x and y.
(b) Represent the feasible solutions on a rectangular coordinate plane.
(c) If the rental for a coach A and a coach B are $200 and $800 respectively, how many coaches of each type should be hired so that the rental is kept at the minimum? Find the minimum rental.
8.26
© 2009 Chung Tai Educational Press. All rights reserved.
59. A carpenter is going to produce x pieces of furniture A and y pieces of furniture B. The details of producing a piece of furniture A and a piece of furniture B are as follows.
Material required (unit) Production time (hour)
Furniture A 15 5
Furniture B 20 3
Given that there are 150 units of materials and 28 working hours available,
(a) write down all the constraints about x and y.
(b) represent the feasible solutions on a rectangular coordinate plane.
(c) If the profits of selling a piece of furniture A and a piece of furniture B are $150 and $90 respectively, how many pieces of furniture of each type should the carpenter produce to maximize the profit? Find the maximum profit.
60. A bakery sells pancakes and cakes. Making each kg of pancake requires 2 mangoes and 1 peach, while making each kg of cake requires 4 mangoes and 3 peaches. It is given that the bakery has at most 50 mangoes and 30 peaches available to make x kg of pancakes and y kg of cakes each day.
(a) Write down all the constraints about x and y.
(b) Represent the feasible solutions on a rectangular coordinate plane.
(c) If the profit of selling each kg of cake is 2.5 times the profit of selling each kg of pancake, how many pancakes and cakes (in kg) should be made each day to obtain the maximum profit?
61. The owner of a stationery shop is going to sell at most 120 ball-point pens and 30 correction pens by packing them into x packages A and y packages B. The table below shows the number of ball-point pens and correction pens in each type of package.
Ball-point pen Correction pen
Package A 5 1
Package B 6 2
(a) Write down all the constraints about x and y.
(b) Represent the feasible solutions on a rectangular coordinate plane.
(c) If the profits of selling a package A and a package B are in the ratio of 3 : 5, how many packages of each type should be produced to obtain the maximum profit?
8.27
© 2009 Chung Tai Educational Press. All rights reserved.
62. A food supplier provides students lunch sets with two types of food, A and B. The table below shows the nutritional content of food A and food B.
Carbohydrates (unit) Protein (unit) Fat (unit)
Every 100 g of food A 30 10 4
Every 100 g of food B 24 20 6
It is given that each lunch set should contain at least 108 units of carbohydrates, at least 72 units of protein and at most 36 units of fat. Suppose each lunch set includes x g of food A and y g of food B,
(a) write down all the constraints about x and y.
(b) represent the feasible solutions on a rectangular coordinate plane.
(c) If the cost for every 100 g of food A and food B are $2.8 and $4 respectively, how much food A and food B (in g) should each lunch set include to minimize the cost? Find the minimum cost of each lunch set.
63. A factory is going to spend not more than $53 000 and 300 minutes of working hours in producing 9 000 electronic components. The details of producing every 100 electronic components by three production lines are as follows.
Cost required ($) Production time (minute)
Production line A 500 4
Production line B 600 3
Production line C 800 2
Let x, y and z be the number of electronic components to be produced by production lines A, B and C respectively.
(a) (i) Express z in terms of x and y.
(ii) Write down all the constraints about x and y.
(b) Represent the feasible solutions on a rectangular coordinate plane.
(c) To let production line C produce the greatest possible number of electronic components, how many electronic components should production lines A and B produce? Find the greatest possible number of electronic components to be produced by production line C.
64. Ivan spends x hours in doing part-time job A and y hours in doing part-time job B each day under the following constraints.
I. He should work at least 5 hours and at most 10 hours each day. II. The time spent on part-time job B should be at most twice that on part-time job A. III. The time spent on part-time job A should not be more than that on part-time job B.
8.28
© 2009 Chung Tai Educational Press. All rights reserved.
(a) Write down all the constraints about x and y.
(b) Represent the feasible solutions on a rectangular coordinate plane.
(c) It is given that the hourly wages of part-time job A and part-time job B are $75 and $55 respectively.
(i) How should Ivan allocate his working hours so that his daily income attains its maximum? Find his maximum daily income.
(ii) If Ivan works at most 8 hours each day instead, how should he allocate his working hours so that his daily income attains its maximum?
65. The owner of a bakery uses at most 30 kg of grade A flour, 80 kg of grade B flour and 140 kg of grade C flour to prepare two flour mixtures P and Q. Mixture P is prepared by mixing grade B flour and grade C flour in the ratio of 1 : 2. Mixture Q is prepared by mixing grade A, grade B and grade C flour in the ratio of 1 : 2 : 3. It is given that the owner prepares x kg of mixture P and y kg of mixture Q.
(a) Write down all the constraints about x and y.
(b) Represent the feasible solutions on a rectangular coordinate plane.
(c) Given that the profit of making bread with each kg of mixture Q is three times that with each kg of mixture P,
(i) how much mixture (in kg) of each type should the owner prepare to maximize the profit?
(ii) When the profit is at the maximum, how much flour (in kg) of each type is used to prepare the two flour mixtures?
8.29 29
2009 Chung Tai Educational Press. All rights reserved.
Worksheet 8A - I (page 8.1) 2. (a) 2 xy (b) 33 yx
Worksheet 8A - II (page 8.3)
2. (a)
23
632
yx
yx (b)
sregetni era dna 2
33
yxy
xyxy
Worksheet 8B (page 8.5)
1.
sregetni evitagen-non era dna 80945056
yxyxyx
2. (a)
sregetni evitagen-non era dna 60543023
yxyxyx
Worksheet 8C (page 8.7) 1. (a) Maximum value 15, minimum value 1
(b) Maximum value 10, minimum value 14
(c) Maximum value 2, minimum value 9
2. (b) Maximum value 18, minimum value 12
3. (a)
sregetni eivtagen-non era dna 72043
000 145
yxyxyx
(c) 140 items A and 75 items B
Build-up Exercise 8A (page 8.13) 2. (a) 52 yx (b) 1243 yx
5. (a)
220
xxyyx
(b)
13065
521
yyx
xyxy
6. (a)
sregetni era dna 1
222
yxy
yxyx
(b)
sregetni era dna 00
6322054
yxyx
yxyx
7. (a) 1474 xy
(b) (i) No (ii) No
(iii) Yes
12. (a)
8233
1
yxyx
yx
(b) (2, 0), (3, 1), (4, 1), (4, 2), (5, 1)
21. (a) 532 yx (b) 4
22. (a) 632 yx (b) 6
23. (b) (2, 3), (2, 4), (3, 3), (4, 2)
24. (b) (1, 2), (1, 3), (2, 2), (2, 3), (3, 3)
25. (b) 3
26. (b) (i) 2 (ii) 2
(iii) 12
Build-up Exercise 8B (page 8.18)
27.
002
10
yx
yxyx
28.
sregetni evitagen-non era dna 60052
4002
yxyx
yx
29.
sregetni evitagen-non era dna 15023
60224034
yxyx
yxyx
30. (a)
00
801202
yx
yxyx
31. (a)
sregetni eivtagen-non era dna 1832
102
yxyx
yx
32. (a)
sregetni evitagen-non era dna 600390023
yxyxyx
33. (a)
sregetni evitagen-non era dna 280
5002400
yxx
yxyx
34. (a)
00
500 15490023
600 154
yx
yxyxyx
8.30
© 2009 Chung Tai Educational Press. All rights reserved.
35. (a)
���
���
�
≤+≤+
≤+
sregetni evitagen-non era dna 1502
24023100
yxyxyx
yx
36. (a) Suppose x cats and y dogs are to be bought, the constraints are
���
���
�
≥≤+
≤+
sregetni evitagen-non era dna
4515053
yxyxyx
yx
.
37. (a) Suppose x boxes of DVDs and y boxes of VCDs are produced each hour,
the constraints are
���
���
�
≤≤+≤+
sregetni evitagen-non era dna 32
200 123100 237
yxyxyxyx
.
38. (a) Suppose x first-class seats and y economy-class seats are provided,
the constraints are
���
���
�
≤+<
≤+
sregetni eivtagen-non era dna 800516
4200 1815
yxyx
yxyx
.
39. (a) Suppose x kg of mixture A and y kg of mixture B are to be produced,
the constraints are
���
�
���
�
�
≥≥≤
≤+≤+
≤+
02002
000 24700
400 225
xy
xyyx
yxyx
.
Build-up Exercise 8C (page 8.22) 40. Maximum value: 5=x , 0=y , minimum value: 0=x , 5=y
41. Maximum value: 0=x , 0=y , minimum value: 0=x , 3−=y
42. Maximum value = 5.5, minimum value = −2
43. Maximum value = 3, minimum value = −12
44. Maximum value = 12, minimum value = −12
45. Maximum value = 2, minimum value = −22
46. Maximum value = −2, minimum value = −8
47. Maximum value = 7, minimum value = −26
48. Maximum value = 33, minimum value = −7
49. Maximum value = 21, minimum value = −13
50. Maximum value = 6, minimum value = −10
51. Maximum value = −4, minimum value = −40
52. (b) Maximum value = 11, minimum value = −4 (c) Maximum value = 6, minimum value = −4
53. (b) Maximum value = 28, minimum value = 6 (c) Maximum value = 36, minimum value = 6
54. (a)
���
���
�
≥≤−+
≤≥−+
5030
200454
yyx
xyx
(b) (i) Maximum value = 45, minimum value = −45 (ii) 105 ≤≤ y
55. (a) A(6, 5), B(−4, 1), C(0, −3), D(3, −1) (b) Maximum value = 15, minimum value = −10
56. (a) ��
���
≤+≤+
sregetni evitagen-non era dna 70
18032
yxyx
yx
(c) 30 items A and 40 items B
57. (a) ��
���
≥+≥+
sregetni evitagen-non era dna 1232
102
yxyx
yx
(c) Package A: 4, package B: 2
58. (a)
���
���
�
≤≤+
≥+
sregetni evitagen-non era dna 3
8153
yxx
yxyx
(c) 3 coaches A and 4 coaches B; $3 800
59. (a) ��
���
≤+≤+
sregetni evitagen-non era dna 28353043
yxyxyx
(c) 2 pieces of furniture A and 6 pieces of furniture B, or 5 pieces of furniture A and 1 piece of furniture B; $840
60. (a)
���
���
�
≥≥
≤+≤+
00
3035042
yx
yxyx
(c) 15 kg of pancakes and 5 kg of cakes
61. (a) ��
���
≤+≤+
sregetni evitagen-non era dna 30212065
yxyx
yx
(c) 14 packages A and 8 packages B
62. (a)
��
�
��
�
�
≥≥
≤+≥+
≥+
00
800 1327202
800 145
yx
yxyx
yx
(c) 120 g of food A and 300 g of food B; $15.36
63. (a) (i) yxz −−= 000 9
(ii)
���
���
�
≤+≤+
≥+
sregetni evitagen-non era dna 000 9
000 122000 1923
yxyxyxyx
(c) Production line A: 5 000, production line B: 2 000; 2 000
8.31
© 2009 Chung Tai Educational Press. All rights reserved.
64. (a)
���
�
���
�
�
≥≥≤≤
≤+≥+
00
2105
yx
yxxy
yxyx
(c) (i) 5 hours of part-time job A and 5 hours of part-time job B; $650
(ii) 4 hours of part-time job A and 4 hours of part-time job B
65. (a)
��
�
��
�
�
≥≥
≤+≤+
≤
00
84034240
180
yx
yxyx
y
(c) (i) 60 kg of mixture P and 180 kg of mixture Q (ii) 30 kg of grade A flour, 80 kg of grade B flour and
130 kg of grade C flour