Professional Documents
Culture Documents
NSS Mathematics in Action - 5A04 - Exercise - E
NSS Mathematics in Action - 5A04 - Exercise - E
4 Linear Programming
1.
2. y 2 0 2
x 2 3 4
y 1 3 5
Draw the line .
x 1 3 5
115
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
y 0 1 2
Quick Practice
Quick Practice 4.1 (p. 4.8)
Draw the solid line .
x 0 2 4
y 1 2 5
∵ The two straight lines intersect at (2.5, 0.5).
∴ The solution is x = 2.5 and y = 0.5. When x = 0 and y = 0,
Value of x + y –1 5 7
Value of x + y –1 6
(b) parallel
∴
3. (a) 1, 1
∴ The required inequality is .
2, 2
3, 3
4. 3, 3
116
4 Linear Programming
Quick Practice 4.4 (p. 4.15) Quick Practice 4.7 (p. 4.26)
Graphical representation of : (a)
(b)
(b) Since x and y are integers, the required possible pairs are
represented by the dots in the figure below.
117
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
(b)
118
4 Linear Programming
(b)
119
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
(b)
(b)
120
4 Linear Programming
(c) Let $C be the cost, then C = 15x + 10y. (c) Let $C be the total cost on hiring workers per day.
(b)
∴ One inequality is .
121
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
Choose a point in the shaded region, say (3, 0). (i) From the graph, P attains its maximum at (4, 0.5).
When and , ∴ Maximum value of P
∴ The remaining inequality is . From the graph, P attains its minimum at (0, 0.5).
Hence, the required system of inequalities is ∴ Minimum value of P
.
(ii) Since x and y are integers, the feasible solutions
Further Practice (p. 4.30)
are represented by the dots in the figure below.
1. (a) ∵ The shaded region is on the left of the line
.
∴ One inequality is .
∵ The shaded region is above the line .
∴ One inequality is .
Choose a point in the shaded region, say (0, 0).
When and ,
∴ The remaining inequality is . From the graph, P attains its maximum at (3, 0).
Hence, the required system of inequalities is ∴ Maximum value of P = 2(3) + 0 + 0.5 =
.
From the graph, P attains its minimum at (0, 0).
(b) By substituting x = 3 into the equation of L3, ∴ Minimum value of P = 2(0) + 0 + 0.5 =
we have:
Exercise
∴ One of the vertices is (3, 5). Exercise 4A (p. 4.11)
By substituting y = 2 into the equation of L3, Level 1
we have: 1.
122
4 Linear Programming
123
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
∴
∴ The required inequality is .
124
4 Linear Programming
∴
∴ The required inequality is .
∵
∴ The ordered pair (1, –10) is not a solution of the
inequality .
2.
3.
125
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
5. Choose a point in the shaded region, say (2, 2). 10. The solutions of are represented by the
∵ shaded region in the figure below.
Level 2
13.
126
4 Linear Programming
14. 15. Choose a point in the shaded region, say (1, 1).
∵ 2x + 3y = 2(1) + 3(1) = 5 ≤ 6
∴ One inequality is 2x + 3y ≤ 6.
∵ x+y1=1+11=1≥0
∴ One inequality is x + y 1 ≥ 0.
∵ x=1≥0
∴ One inequality is x ≥ 0.
∴ The system of inequalities is
.
127
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
128
4 Linear Programming
(b) P attains its minimum at (–2, –1), and the 2. Check the values of P = –2x + y at the three vertices.
corresponding minimum value of P is –5. At (0, 4), P = –2(0) + (4) = 4
At (0, 0), P = –2(0) + (0) = 0
At (6, 0), P = –2(6) + (0) = –12
(a) P attains its maximum at (0, 4), and the
corresponding maximum value of P is 4.
(b) P attains its minimum at (6, 0), and the corresponding
minimum value of P is –12.
5.
6.
129
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
7. (a) Choose a point in the shaded region, say (0, 0). (c) (i)
∵ x y 2 = 0 0 2 = 2 ≤ 0
∴ One inequality is x y 2 ≤ 0.
∵ x = 0 ≥ 2
∴ One inequality is x ≥ 2.
∵ y=0≤3
∴ One inequality is y ≤ 3.
∴ The system of inequalities is
.
∵ y=2≥ and y = 2 ≤ 5 From the graph, P attains its maximum at (0, 5).
∴ Maximum value of P =
∴ One inequality is . From the graph, P attains its minimum at (3, 2).
∴ Minimum value of P =
∴ The system of inequalities is
9. (a) The solutions of are
.
represented by the shaded region in the figure below.
130
4 Linear Programming
Level 2
12. The solutions of
are
represented by the
shaded region in the figure below.
131
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
19. (a) The shaded region is the common region of the left
Check the values of at the three vertices. half-plane of L1, the lower half-plane of L2, the upper
At (1, 0), half-plane of L3 and the upper half-plane of L4.
∴ The system of inequalities is
At (2, 4),
At (5, ), .
∴ Maximum value of P =
Minimum value of P =
(b) Coordinates of A
∴ Coordinates of B
132
4 Linear Programming
133
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
(b) (i) Check the values of at the three (ii) Since x and y are integers, the feasible solutions
vertices. are the points indicated by the dots in the figure.
At (2, 1),
At (1.5, 2.5),
At (5, 1),
∴ Maximum value of P =
∴ Minimum value of P =
At (1.5, 5),
At (3.5, 2),
∴ Maximum value of P
Minimum value of P
134
4 Linear Programming
(b)
(b)
135
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
(c) Let $P be the profit, then P = 500x + 400y. 8. (a) The constraints are:
(b)
(b)
136
4 Linear Programming
From the graph, C attains its minimum at (10, 3). 11. (a) The constraints are:
∴ The company should hire 10 buses A and
3 buses B.
∴ The minimum cost
(b)
Level 2
10. (a) The constraints are:
(b)
137
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
(b)
(b)
From the graph, P attains its maximum at (10, 15).
∴ There should be 10 pairs of shoes and 15 pairs
of boots.
∴ The maximum profit
138
4 Linear Programming
(b)
139
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
3. When x = 0 and y = 0,
2x + 3 = 2(0) + 3 = 3
After simplification, we have: y=0
∴ y 2x + 3
∴ The shaded region in the figure represents the
solutions of the inequality y 2x + 3.
(b)
4. The solutions of x 2 can be represented by the right
half-plane of x = 2.
∴ Region III or IV represents the solution.
Choose (4, 4) as the test point.
When x = 4 and y = 4,
x + 2y = 4 + 2(4) = 12 ≰ 6
∴ The half-plane without the test point (4, 4)
represents the solutions of the inequality.
∴ Region IV in the figure represents the solutions of
.
140
4 Linear Programming
6. The solutions of are represented by the (ii) Check the values of at the
shaded region in the figure below. three
vertices.
At (0, 2),
At (1, 1),
At (2, 4),
∴ Maximum value of P =
Minimum value of P =
7. The solutions of are represented by the
shaded region in the figure below. Revision Exercise 4 (p. 4.54)
Level 1
1. When x = 0 and y = 0,
2. When x = 0 and y = 0,
3. When x = 0 and y = 0,
10. (a) Choose a point in the shaded region, say (0, 0).
∵ x+y+2=0+0+2=2 3x 2y = 3(0) + 2(0) = 0 1
∴ One inequality is x + y + 2 ≥ 0. ∴ The half-plane containing the test point (0, 0)
together with the boundary represents the solutions of
∵ 3x y + 2 = 3(0) 0 + 2 = 2
the inequality.
∴ One inequality is 3x y + 2 ≥ 0.
∵ 3x + y 2 = 3(0) + 0 2 = 2
∴ One inequality is 3x + y 2 ≤ 0.
∴ The system of inequalities is
.
141
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
142
4 Linear Programming
11. Choose a point in the shaded region, say (4, 2). 16. The solutions of are represented by the
∵ x+3=4+3=7 shaded region in the figure below.
y=2
∴ One inequality is y ≤ x + 3.
∵ 6 3x = 6 3(4) = 6
y=2
∴ One inequality is y > 6 3x.
∴ The system of inequalities is .
143
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
21. The solutions of From the graph, P attains its maximum at (4, 3).
are represented by ∴ Maximum value of P
the shaded region in the figure below. From the graph, P attains its minimum at (1, 1).
∴ Minimum value of P
26.
23. Check the values of at the three vertices. 27. (a) The solutions of are
At (2, 9), P = –2 + 3(9) = 25 represented by the shaded region in the figure below.
At (1, 3), P = 1 + 3(3) = 10
At (4, 6), P = 4 + 3(6) = 22
∴ Maximum value of P =
Minimum value of P =
144
4 Linear Programming
(ii) Check the values of at the 30. (a) The constraints are:
three
vertices.
At (2, 6), (b)
At (7, 6),
At (7, 1),
∴ Maximum value of P =
Minimum value of P =
From the graph, Q attains its minimum at (13, 1). From the graph, P attains its maximum at (8, 8).
∴ Minimum value of Q ∴ 8 clay sculptures and 8 wood sculptures should
be produced per week.
∴ The maximum profit
29. (a) The constraints are:
(b)
31. (a) The constraints are:
145
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
(b)
From the graph, C attains its minimum at (3, 5).
∴ The lorry should make 3 rounds of delivery and
the van should make 5 rounds of delivery.
∴ The minimum cost
(b)
146
4 Linear Programming
(b)
(c) Let $P be the profit, then P = 8x + 6y.
Level 2
37. (a) The solutions of are
represented by the shaded region in the figure below.
36. (a) The constraints are: (b) Mark the given points on the graph as shown below.
From the graph, C(2, 2), D(3, 1) and E(7, –1) satisfy
the system of inequalities in (a).
147
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
38. (a) The solutions of Therefore, from the graph, p can be any value in the
are represented by the range .
shaded region in the figure below.
41. (a) The solutions of
are represented by the shaded region in the figure
below.
(b) (i)
39. (a)
40. (a)
148
4 Linear Programming
(b) (i) Choose a point in the shaded region, say (0, 0).
∵ 2x 3y = 2(0) 3(0) = 0 ≤ 12 (b) (i) Check the values of P = 7x + 4y at the four
vertices.
∴ One inequality is 2x 3y ≤ 12.
∵ 2x + 3y = 2(0) + 3(0) = 0 ≤ 12 At (0, 4), P = 7(0) + 4(4) = 16
∴ One inequality is 2x + 3y ≤ 12. At (2, 5), P = 7(2) + 4(5) = 6
∵ 2x y = 2(0) 0 = 0 ≥ 4 At (6, 5), P = 7(6) + 4(5) = 22
∴ One inequality is 2x y ≥ 4. At (5, 1), P = 7(5) + 4(1) = 31
∴ The system of inequalities is ∴ Maximum value of P =
Minimum value of P =
.
149
delete label: x = 0, y = 0
(b)
Check the values of P = 7x + 4y at the four
vertices.
At (0, 4), P = 16
At (4, 6), P = 7(4) + 4(6) = 4
At (6, 5), P = 22
At (5, 1), P = 31
∴ Maximum value of P
Minimum value of P
(b)
150
4 Linear Programming
(b)
(b)
151
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
(b)
Cost of transporting coal to company B From the graph, C attains its minimum at (20, 10).
∴ 20 helicopters and 10 transport-troops should be
used.
∴ The minimum cost
Let $C be the total transportation cost, then
2. Answer: B
∵ The straight line passes through (3, 0) and (0, 3).
∴ Equation of the straight line:
152
4 Linear Programming
∴ The inequality is x – y + 3 0.
3. Answer: D
Choose (1, 0) as the test point.
When x = 1 and y = 0,
x+y=1+0=1≥0
xy=10=1≥0
∴ (1, 0) is one of the solutions of the system.
∴ The answer is D.
4. Answer: D
Choose (4, 2) as the test point.
When x = 4 and y = 2,
2x + y = 2(4) + (2) = 6 ≥ 0
x 2y 4 = 4 2(2) 4 = 4 ≥ 0
∴ (4, 2) is one of the solutions of the system.
∴ Region IV, which contains (4, 2), is the answer.
5. Answer: A
Since x ≤ 2, regions I and II may be the answer.
Equation of the line passing through (0, 4) and (4, 0):
Consider x + y ≥ 4.
Use test point (1, 1), we have
x+y=1+1=2≱4
∴ Region I, that does not contain (1, 1), is the answer.
6. Answer: D
∵ The shaded region is the common region of the lower
half-plane of y = 3, the upper half-plane of x + y = 0,
i.e. y = x and the upper half-plane of x – y + 3 = 0,
i.e. y = x + 3.
∴ The system of the inequalities is
,
i.e. .
7. Answer: C
∵ The shaded region is in the right half-plane of .
∴
∴ I must be true.
∵ The shaded region is in the lower half-plane of
.
∴
, i.e. .
153
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
∴ Slope of L
By substituting (2) into (1), we have
∴ L1 intersects the y-axis at (0, 6). (b) Choose a point in the shaded region, say (0, 0).
By substituting y = 0 into (2), we have ∵ y = 0 ≥ 1
∴ One inequality is y ≥ 1.
∵ x + 4 = (0) + 4 = 4
∴ L2 intersects the x-axis at (9, 0). y=0
Check the values of at the four ∴ One inequality is y ≤ x + 4.
∵ x+1=0+1=1
vertices.
y=0
At (0, 0), ∴ One inequality is y ≤ x + 1.
At (0, 6), ∴ The system of inequalities is
At (9, 0), .
154
4 Linear Programming
2. (a) The shaded region is the common region of the left 3. Answer: C
half-plane of x = 7, the lower half-plane of
The slope of ax + by = 0 is .
, i.e. and the upper half-
∵ a, b > 0
∴ The slope of the line ax + by = 0 is negative, and the
plane of , i.e. . line slopes downwards.
Choose (0, 1) as the test point.
∴ The system of inequalities is When x = 0 and y = 1,
. ax + by = a(0) + b(1) = b > 0
∴ The half-plane containing the test point (0, 1)
(b) (i) The constraints are: represents the solutions of the inequality.
∴ The answer is C.
4. Answer: A
After simplification, we have: The shaded region is the common region of the lower half
plane of x + y = 2, i.e. , the lower half-plane
of
y = x and the upper half-plane of y = 0.
Let the total cost be $C, ∴ The system of inequalities is
then C = 5000x + 4000y.
,
Slope of 5000x + 4000y = 0 is , i.e. i.e. .
5. Answer: C
∵ The shaded region of is the
common region of the right half-plane of x = 4, the left
Slope of is half-plane of x = 0, the upper half-plane of y =
5 and the lower half-plane of y = 0.
∵ Slope of 5000x + 4000y = 0 is less negative
∴ Regions II, IV and VI may be the solution.
than that of .
∴ 5000x + 4000y = 0 is less steeper than ∵ , i.e.
.
Therefore, refer to the graph given in (a),
C attains its minimum at point A. ∴ The lower half-plane of , i.e.
6. Answer: D
The point (x, y) lying outside R does not satisfy one of the
inequalities in the system
By substituting x = 7 into .
, When x = 4 and y = 6,
we have ,
which does not satisfy the inequality .
∴ (4, 6) lies outside R.
∴ The coordinates of A are (7, 4).
Minimum cost = $[5000(7) + 4000(4)] = $51 000,
which is already over $50 000.
Hence, the manager’s claim is correct.
boxes
of the plastic for the factory.
The cost = $5000(10) = $50 000
∴ The total cost will be decreased.
155
NSS Mathematics in Action (2nd Edition) 5A Full Solutions
(1) × 2 (2):
By substituting y = 4 into (1), we have From the graph, P attains its maximum at (52, 54).
∴ The supermarket should prepare 52 packs A and
54 packs B to obtain the maximum daily profit.
∴ One of the vertices is (2, 4). (b) Decrease in the maximum daily profit
Check the values of at the four vertices.
At (0, 0),
At (4, 0),
At (0, 3),
At (2, 4),
4. When D increases to 10, P becomes 15x + 15y. By
∴ Maximum value = 10 translating the line 15x + 15y = 0, we can check that
Minimum value = 4 P attains its maximum at two points (52, 54) and (53, 53).
∴ The answer is C. Further increasing the value of D, P will attain its
maximum at (53, 53) rather that (52, 54).
Investigation Corner (p. 4.73) Hence, the required value is 10.
1. The constraints are:
156
4 Linear Programming
157