You are on page 1of 43

4 Linear Programming

4 Linear Programming

Review Exercise 4 (p. 4.4)

1.

∵ The two straight lines intersect at (4, 5).


∴ The solution is x = 4 and y = 5.

4. Draw the line .


x 4 2 0

2. y 2 0 2

3. Draw the line .

x 2 3 4

y 1 3 5
Draw the line .
x 1 3 5

y 3.5 4.5 5.5

115
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

Draw the line . To Learn More (p. 4.11)


x 2 Graphical representation of y ≤ ax + b:
4 1

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,

Activity ∴ The half-plane containing the test point (0, 0) together


with the boundary represents the solutions of the
Activity 4.1 (p. 4.6) inequality.
Graphical representation of 3x  2y ≤ 2:
1. Point (x, y) B(–2, 1) C(–1, 6) D(3, 4)

Value of x + y –1 5 7

Point (x, y) E(2, –3) F(6, 0)

Value of x + y –1 6

Quick Practice 4.2 (p. 4.9)


2. (a) C, D and F Draw the dotted line .
(c) Yes, upper half-plane
x 0 2 4
3. (a) A, B and E
(c) Yes, lower half-plane y 3 1.5 0
When x = 0 and y = 0,
Activity 4.2 (p. 4.22) 3x + 4y = 3(0) + 4(0) = 0 ≯ 12
1. 0 ∴ The half-plane without the test point (0, 0) represents the
solutions of the inequality.
2. (a) Graphical representation of 3x + 4y > 12:

Quick Practice 4.3 (p. 4.10)


Choose a point in the shaded region, say (2, 0).
When and ,

(b) parallel

3. (a) 1, 1
∴ The required inequality is .
2, 2
3, 3

(b) (i) increases


(ii) decreases

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)

Quick Practice 4.5 (p. 4.16)


(a) Graphical representation of
:

(b)

(b) Since x and y are integers, the required possible pairs are
represented by the dots in the figure below.

From the graph, P attains its maximum at (3, 4).


∴ Maximum value of
From the graph, P attains its minimum at (–5, 4).
∴ Minimum value of
Alternative Solution
∴ There are 10 pairs of x and y which satisfy the system Check the values of P = 3x  y at the three vertices.
of inequalities in (a). At (3, 4),
At (–5, 4),
Quick Practice 4.6 (p. 4.17)
∵ The shaded region is on the right of the line . At (–1, –4),
∴ One inequality is . ∴ The maximum value of P is 5, and the minimum
value of P is –19.
∵ The shaded region is below the line .
∴ One inequality is . Quick Practice 4.8 (p. 4.28)
Choose a point in the shaded region, say (0, 0). (a)
When and ,
x  2 = 0  2 = 2
y=0
∴ The remaining inequality is .
Hence, the required system of inequalities is
.

117
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

(b)

From the graph, P attains its maximum at (4, 2).


∴ Maximum value of

From the graph, P attains its minimum at (8, 8).


∴ Minimum value of
Alternative Solution
Check the values of P = 2x  3y at the three vertices.
At (–4, 4),
At (–4, –2),
At (8, 8),
∴ The maximum value of P is 14, and the minimum
value of P is –40.

Quick Practice 4.9 (p. 4.30)


(a)

From the graph, P attains its maximum at (4, 1).


∴ Maximum value of
From the graph, P attains its minimum at (–3.5, –3.5).
∴ Minimum value of

(b) Since x and y are integers, the feasible solutions are


represented by the dots in the figure below.

From the graph, P attains its maximum at (4, 1).

118
4 Linear Programming

∴ Maximum value of Quick Practice 4.10 (p. 4.37)

From the graph, P attains its minimum at (–3, –3).


∴ Minimum value of
(a) The constraints are:

After simplification, we have .

(b)

(c) Let $P be the profit, then .

From the graph, P attains its maximum at (5, 7.5).


∴ Maximum value of P

∴ The candy shop should produce 5 kg of dark


chocolate and 7.5 kg of white chocolate each day to
attain a maximum profit of $2700.

Quick Practice 4.11 (p. 4.39)

(a) The constraints are:

119
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

(b)

(c) Let $C be the cost, then .

From the graph, C attains its minimum at (30, 30).


∴ Minimum value of C

∴ 30 L of drink A and 30 L of drink B should be


ordered to attain a minimum cost of $1050.

Quick Practice 4.12 (p. 4.41)


(a) The constraints are:

After simplification, we have

(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.

From the graph, C attains its minimum at (2, 1).


∴ Minimum value of C = 15(2) + 10(1) = 40
∴ A can of cat food should contain 200 g of foodstuff A
and 100 g of foodstuff B to attain a minimum cost of
$40. From the graph, C attains its minimum at (6, 9).
∴ The minimum total cost on hiring workers per day
Quick Practice 4.13 (p. 4.44)
(a) ∵ There are x full-time workers working in the daytime.
∴ There are (10 – x) full-time workers working in
overnight sessions.
∵ There are y part-time workers working in the Further Practice
daytime.
∴ There are (15 – y) part-time workers working in Further Practice (p. 4.18)
overnight sessions. 1. (a) Graphical representation of
The constraints are: :

After simplification, we have:

(b)

(b) Since x and y are positive integers, the required


possible pairs are represented by the dots in the figure
below.

∴ The required possible pairs are (1, 3) and (1, 4).

2. ∵ The shaded region is on the right of the line .


∴ One inequality is .
∵ The shaded region is below the line .
∴ One inequality is .
Choose a point in the shaded region, say (3, 0).
When and ,

∴ 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.

∴ One of the vertices is (3, 2).


The remaining vertex is (3, 2).
Check the values of P = 4x + 3y at the three vertices.
At (3, 2),
At (3, –2),
At (3, 5), 2. Choose (0, 0) as the test point.
∴ The maximum value of P is 6, and the minimum When x = 0 and y = 0,
value of P is –18. ≱0
∴ The half-plane without the test point (0, 0) represents
2. (a) the solutions of the inequality.
Graphical representation of y ≤ x  2:

(b) 3. Choose (1, 2) as the test point.


When x = 1 and y = 2,
2x = 2(1) = 2 < 2
∴ The half-plane containing the test point (1, 2)
represents the solutions of the inequality.
Graphical representation of y > 2x:

122
4 Linear Programming

4. Choose (0, 0) as the test point.


When x = 0 and y = 0,
x + 2y = 0 + 2(0) = 0 < 6
∴ The half-plane containing the test point (0, 0)
represents the solutions of the inequality.
Graphical representation of x + 2y < 6:

5. Choose (0, 0) as the test point.


When x = 0 and y = 0,
3x + 2y = 3(0) + 2(0) = 0 ≱ 5
∴ The half-plane without the test point (0, 0)
represents the solutions of the inequality.
Graphical representation of 3x + 2y ≥ 5:

6. Choose (0, 0) as the test point.


When x = 0 and y = 0,
2x + y  3 = 2(0) + 0  3 = 3 ≯ 0
∴ The half-plane without the test point (0, 0)
represents the solutions of the inequality.
Graphical representation of 2x + y  3 > 0:

7. Draw the solid line y = x – 3.


Choose (0, 0) as the test point.
When x = 0 and y = 0,
x  3 = (0)  3 = 3 ≤ 0
∴ The half-plane containing the test point (0, 0)
together with the boundary represents the solutions of
the inequality.

123
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

8. Draw the dotted line y = 3x + 2. 14.


Choose (0, 0) as the test point.
When x = 0 and y = 0, Draw the solid line 3x – y = 3.
3x + 2 = 3(0) + 2 = 2 > 0 Choose (0, 0) as the test point.
∴ The half-plane containing the test point (0, 0) When x = 0 and y = 0,
represents the solutions of the inequality. 3x  y = 3(0)  0 = 0 ≰ 3
∴ The half-plane without the test point (0, 0)
represents the solutions of the inequality.

9. Draw the dotted line x = 2y. 15.


Choose (1, 2) as the test point.
When x = 1 and y = 2, Draw the dotted line 5x – 4y = 0.
2y = 2(2) = 4 ≮ 1 Choose (2, 1) as the test point.
∴ The half-plane without the test point (1, 2) When x = 2 and y = 1,
represents the solutions of the inequality. 5x  4y = 5(2)  4(1) = 6 ≮ 0
∴ The half-plane without the test point (2, 1)
represents the solutions of the inequality.

10. Draw the solid line .


Choose (0, 0) as the test point.
When x = 0 and y = 0,
2x  y = 2(0)  0 = 0 ≤ 4
∴ The half-plane containing the test point (0, 0) 16. (a) Choose a point in the shaded region, say (0, 0).
together with the boundary represents the solutions of
the inequality. ∴ The inequality is 2y – 4x  3.

(b) From the graph, when x = 2, the maximum integral


value of y satisfying the inequality is 5.
∴ The maximum value of b is 5.

17. (a) Choose (0, 0) as the test point.


When x = 0 and y = 0,
2x  2 = 2(0)  2 = 2 < 0
Level 2 ∴ The half-plane containing the test point (0, 0)
11. Choose a point in the shaded region, say (0, 0). represents the solutions of the inequality.
When and ,


∴ The required inequality is .

12. Choose a point in the shaded region, say (2, 0).


When and ,

(b) From the graph, when y = 2, the minimum integral


∴ The required inequality is . value of x satisfying the inequality is 1.
∴ The minimum value of h is 1.
13. Choose a point in the shaded region, say (1, 0).
When and ,

∴ The required inequality is .

124
4 Linear Programming

18. (a) By substituting x = 4 and y = 0 into , 4.


we have

(b) Choose a point in the shaded region, say (0, 0).


When and ,


∴ The required inequality is .

(c) When and ,


∴ The ordered pair (1, –10) is not a solution of the
inequality .

Exercise 4B (p. 4.18)


Level 1
1.

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.

∴ One inequality is y ≤ 2x  3.



∴ One inequality is y ≥ 3.
∴ The system of inequalities is
.

6. Choose a point in the shaded region, say (1, 0).


∵ x + 2 = 1 + 2 = 1
y=0
∴ One inequality is y < x + 2.
∵ y = 0 > 1
∴ One inequality is y > x.
∴ The system of inequalities is .

7. Choose a point in the shaded region, say (1, 2).


∵ 3x  y = 3(1)  (2) = 1 ≤ 2
∴ One inequality is 3x  y ≤ 2.
∵ x  2y = 1  2(2) = 3 ≥ 1 11. The solutions of are represented
∴ One inequality is x  2y ≥ 1. by the shaded region in the figure below.
∴ The system of inequalities is .

8. Choose a point in the shaded region, say (2, 1).


∵ x=2≥1
∴ One inequality is x ≥ 1.
∵ x+y=2+1=3<4
∴ One inequality is x + y < 4.
∵ x + 3y = 2 + 3(1) = 5 ≥ 4
∴ One inequality is x + 3y ≥ 4.
∴ The system of inequalities is
. 12. The solutions of are represented by
the shaded region in the figure below.
9. 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+y1=1+11=1≥0
∴ One inequality is x + y  1 ≥ 0.
∵ x=1≥0
∴ One inequality is x ≥ 0.
∴ The system of inequalities is
.

16. Choose a point in the shaded region, say (4, 2).


∵ 2x + 18 = 2(4) + 18 = 10
y = 2
∴ One inequality is y ≤ 2x + 18.
∵ x  3y = 4  3(2) = 10 > 6
∴ One inequality is x  3y > 6.
∵ 4x  y = 4(4)  (2) = 18 ≥ 12
∴ One inequality is 4x  y ≥ 12.
∵ y = 2 ≤ 0
∴ One inequality is y ≤ 0.
∴ The system of inequalities is
.

17. The solutions of are


represented by the shaded region in the figure below.

18. The solutions of are


represented by the shaded region in the figure below.

127
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

19. The solutions of are 22. (a) The solutions of


represented by the shaded region in the figure below. are
represented by the shaded region in the figure below.

20. The solutions of


are represented
by the shaded region in the figure below.

(b) Since x and y are positive integers, the required


possible pairs are represented by the dots in the figure
below.

21. (a) The solutions of are


represented by the shaded region in the figure below.

∴ There are 12 pairs of x and y which satisfy the


system of inequalities
.

23. (a) The solutions of


are
(b) Since x and y are integers, the required possible pairs represented by the shaded region in the figure below.
are represented by the dots in the figure below.

∴ The required possible pairs are (0, –1), (0, 0),


(0, 1) and (1, –1).

(b) Only (2, 5) lies in the solution region. (4, 8) and


(5, 3), which lie on 5x + y – 28 = 0, do not satisfy
the inequality 5x + y – 28 < 0.

Exercise 4C (p. 4.31)


Level 1
1. Check the values of P = 2x + y at the four vertices.
At (3, 3), P = 2(3) + (3) = 9
At (–2, 3), P = 2(–2) + (3) = 1
At (–2, –1), P = 2(–2) + (–1) = –5
At (3, –1), P = 2(3) + (–1) = 5
(a) P attains its maximum at (3, 3), and the corresponding
maximum value of P is 9.

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.

3. Check the values of P = x + 3y at the three vertices.


At (1, 2.5), P = 1 + 3(2.5) = 8.5
At (–1.5, 1), P = –1.5 + 3(1) = 1.5
At (3, 0), P = 3 + 3(0) = 3
(a) P attains its maximum at (1, 2.5), and the
corresponding maximum value of P is 8.5.
(b) P attains its minimum at (–1.5, 1), and the
corresponding minimum value of P is 1.5.

4. Check the values of P = –x – 3y at the four vertices.


At (1.5, 1), P = –1.5 – 3(1) = –4.5
At (–1.5, –1), P = –(–1.5) – 3(–1) = 4.5
At (–0.5, –2), P = –(–0.5) – 3(–2) = 6.5
At (2, –2), P = –2 – 3(–2) = 4
(a) P attains its maximum at (–0.5, –2), and the
corresponding maximum value of P is 6.5.
(b) P attains its minimum at (1.5, 1), and the
corresponding minimum value of P is –4.5.

5.

From the graph, P attains its maximum at (1, 8).


∴ Maximum value of P = 3(1) + 4(8) =
From the graph, P attains its minimum at (–1, 2).
∴ Minimum value of P = 3(–1) + 4(2) =

6.

From the graph, P attains its maximum at (–4, 3).


∴ Maximum value of P = –4(–4) + 2(3) =
From the graph, P attains its minimum at (4, –1).
∴ Minimum of P = –4(4) + 2(–1) =

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
.

(b) (i) Check the values of P = 3x  y at the three


vertices.
At (5, 3), P = 3(5)  3 = 
At (–2, 3), P = 3(–2)  3 = –9
At (–2, –4), P = 3(–2)  (4) = –2 From the graph, P attains its maximum at (2, 5).
∴ Maximum value of P = ∴ Maximum value of P =
Minimum value of P = From the graph, P attains its minimum at (1, 2).
∴ Minimum value of P =
(ii) Check the values of P = 2x  5y at the three
vertices. (ii)
At (5, 3), P = 2(5)  5(3) = 25
At (–2, 3), P = 2(–2)  5(3) = –11
At (–2, –4), P = 2(–2)  5(4) = 24
∴ Maximum value of P =
Minimum value of P =

8. (a) Choose a point in the shaded region, say (1, 2).


∵ 7x + y = 7(1) + 2 = 9 ≥ 5
∴ One inequality is 7x + y ≥ 5.
∵ 7x + 4y = 7(1) + 4(2) = 15 ≤ 34
∴ One inequality is 7x + 4y ≤ 34.

∵ 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.

(b) Since x and y are integers, the required possible pairs


are represented by the dots in the figure below.

(b) Check the values of P = x + 3y at the three vertices.


At (0, 4), P = 0 + 3(4) = 12
∴ There are 11 pairs of (x, y) which satisfy the At (0, 5), P = 0 + 3(5) = 15
system of inequalities in (a). At (7.2, 4), P = 7.2 + 3(4) = 4.8
∴ Maximum value of P =
Minimum value of P =

130
4 Linear Programming

10. (a) The solutions of are


represented by the
shaded region in the figure below.

Check the values of at the four vertices.


At (0, 0),
At (6, 0),
At (1, 2.5),
At (0, 2),
∴ Maximum value of P =
(b) Check the values of P = 4x + y + 2 at the four vertices.
Minimum value of P =
At (1, 7), P = 4(1) + 7 + 2 = 5
At (1, 9), P = 4(1) + 9 + 2 = 7 13. The solutions of
At (2, 9), P = 4(2) + 9 + 2 = 19
At (2, 4), P = 4(2) + 4 + 2 = 14
∴ Maximum value of P = are represented by the
shaded region in the figure below.
Minimum value of P =

11. (a) The solutions of are


represented by the
shaded region in the figure below.

Check the values of at the four vertices.


At (0, 0),
At (0, 5),
At (4, 2),
At (3, 0),
(b) Check the values of P = 2x – 6y at the four vertices. ∴ Maximum value of P =
At (1, 1), P = 2(1) – 6(1) = 8 Minimum value of P =
At (1, 2), P = 2(1) – 6(2) = 14
At (2, 2), P = 2(2) – 6(2) = 16 14. The solutions of
At (2, 0.5), P = 2(2) – 6(0.5) = 7
are represented
∴ Maximum value of P =
by the
Minimum value of P = shaded region in the figure below.

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

Check the values of at the four 17. The solutions of


vertices. are represented by the
At (0, 0), shaded region in the figure below.
At (0, 4),
At (2, 2),
At (3, 0),
∴ Maximum value of P =
Minimum value of P =

15. The solutions of are


represented by the
shaded region in the figure below.

Check the values of at the three


vertices.
At (2, 3),
At (4, 7),
At (3, 0),
∴ Maximum value of P =
Minimum value of P =
Check the values of at the three vertices.
At (1, 1), 18. (a) Check the values of P = x +3y – 6 at the four
vertices.
At (3, 3),
At (1, 3), P = 5(1) + 3(3) – 6 = 2
At (5, 3), At (0, 4), P = (0) + 3(4) – 6 = 6
∴ Maximum value of P = At (3, 6), P = 5(3) + 3(6) – 6 = 27
At (5, 2), P = 5(5) + 3(2) – 6 = 13
Minimum value of P =
∴ Maximum value of P =
16. The solutions of Minimum value of P =
are represented
by the (b) (i) (or any other
shaded region in the figure below. reasonable answers)

(ii) For , P attains its minimum at (0, 4).


∴ Minimum value of P

For , P attains its minimum at


(0, 4).
∴ Minimum value of

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

By substituting (1) into (2), we have

∴ Coordinates of B

132
4 Linear Programming

By substituting y = 1 into the equation of L2, we have


From (3), we have
x = 3y ……(4)
By substituting (4) into (2), we have
∴ The intersection of L2 and L3 is (1, 1).
Check the values of P = 3x + 4y at the three vertices.
At (2, 4),
By substituting y = 1 into (4), we have At (1, 1),
At (5, 1),
∴ Coordinates of C
∴ Maximum value of P
Minimum value of P
By substituting (5) into (3), we have
21. (a) Check the values of P = 1  x  2y at the three
vertices.
At (1, 2),
∴ Coordinates of D At (3.5, 0.5),

(c) Check the values of P = 2x + y at A, B, C and D


respectively. At (3.5, 4.5),
At A(9, 8), ∴ Maximum value of P
At B(2, 8), Minimum value of P
At C(3, 1),
(b) Since x and y are integers, the feasible solutions
At D(9, 3), are the points indicated by the dots in the figure.
∴ Maximum value of P
Minimum value of P

20. (a) The equation of L2:

∴ From the graph, P attains its maximum at (3, 0).


∴ Maximum value of P
From the graph, P attains its minimum at (3, 4).
The equation of L1: ∴ Minimum value of P

22. (a) The solutions of


are represented by the
shaded region in the figure below.

(b) The shaded region is the common region of the lower


half-plane of L1, the lower half-plane of L2 and the
upper half-plane of L3.
∴ The system of inequalities is
.

(c) By substituting y = 1 into the equation of L1, we have

∴ The intersection of L1 and L3 is (5, 1).

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 =

(ii) Since x and y are integers, the feasible solutions


are the points indicated by the dots in the figure.

From the graph, P attains its maximum at (2, 3).


∴ Maximum value of P

From the graph, P attains its minimum at (–2, –2).


∴ Minimum value of P
From the graph, P attains its maximum at (2, 2).
∴ Maximum value of P
Exercise 4D (p. 4.44)
From the graph, P attains its minimum at (–2, –1).
∴ Minimum value of P Level 1
1. The constraints are:

23. (a) The solutions of 2. The constraints are:


are represented by
the shaded region in the figure below.
After simplification, we have:

3. The constraints are:

After simplification, we have:

4. The constraints are:

After simplification, we have:


(b) (i) Check the values of at the
three vertices.
At (2, 2,

At (1.5, 5),
At (3.5, 2),

∴ Maximum value of P
Minimum value of P

134
4 Linear Programming

(b)

5. (a) The constraints are:

After simplification, we have:

(b)

(c) Let $P be the profit, then P = 300x + 200y.

From the graph, P attains its maximum at (300, 500).


∴ The manufacturer should produce 300 kg of
type A coffee and 500 kg of type B coffee.
∴ The maximum profit

6. (a) The constraints are:

After simplification, we have:

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:

After simplification, we have:

(b)

From the graph, P attains its maximum at (350, 800).


∴ The factory should produce 35 kg of
healthy food A and 80 kg of healthy food B.
∴ The maximum profit

(c) Let $P be the profit, then P = 2000x + 800y.

7. (a) The constraints are:

After simplification, we have:

(b)

From the graph, P attains its maximum at (2, 6).


∴ The carpenter should make 2 tables and 6 chairs.
∴ The maximum profit

9. (a) The constraints are:

After simplification, we have:

(c) Let $C be the cost, then C = 500x + 180y.


(b)

(c) Let $C be the cost, then C = 450x + 600y.

From the graph, C attains its minimum at (4, 4).


∴ The restaurant should buy 4 kg of lobsters and
4 kg of clams.
∴ The minimum cost

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:

After simplification, we have:

(b)

(c) Let $C be the cost, then C = 50x + 70y.

(c) Let $C be the profit from selling each vaccine.


Total profit of selling vaccines = $C(x + y) From the graph, C attains its minimum at (4, 3).
∴ 4 kg of food P and 3 kg of food Q are required
to minimize the cost.
Total weight of the mixture = (4 + 3) kg = 7 kg

∴ There should be kg of food P and kg of

food Q in each kg of the mixture so as to


minimize the cost.

12. (a) The constraints are:

After simplification, we have:

From the graph, the total profit attains its maximum


at (4, 10).
∴ 4 kg of vaccine A and 10 kg of vaccine B should
be produced.

137
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

(b) (c) Let $P be the earnings from 1000 m2 of land for


growing soybeans, then the earnings for growing
corns are $2P.
Total earnings = $(2Px + Py) = $P(2x + y)

From the graph, the total earnings attain its maximum


(c) Let $P be the profit, then P = 4x + 3y. at (60, 20).
∴ The farmer should use 60 000 m2 of land for
corns and 20 000 m2 of land for soybeans.

14. (a) The constraints are:

(b)

From the graph, P attains its minimum at (40, 300).


∴ 40 chocolate eggs and 300 chocolate rabbits
should be made.
∴ The maximum profit
(c) Let $P be the profit, then P = 90x + 75y.

13. (a) The constraints are:

After simplification, we have:

(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

15. (a) The constraints are:

138
4 Linear Programming

After simplification, we have: (b)

(b)

(c) Let $C be the cost, then C = 50x + 35y.

(c) Let $P be the profit, then

From the graph, C attains its minimum at (1, 2).


∴ 1 kg of concrete mix A and 2 kg of concrete mix
B should be mixed.
∴ The minimum cost

17. (a) The constraints are:

After simplification, we have:

From the graph, P attains its maximum at (7, 7).


∴ Maximum value of P = 720(7) + 650(7) = 9590 (b)
Number of magnets should be produced
=180(7) + 100(7) = 1960
Number of key holders should be produced

∴ The factory should produce 1960 magnets and


1890 key holders each day to attain a maximum
profit of $9590.

16. (a) The constraints are:

After simplification, we have:

139
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

(c) Let $C be the cost of production, then (d)


C = 5000x + 4000y.

From the graph, C attains its minimum at (100, 10).


From the graph, C attains its minimum at (2.75, 1.5). ∴ Healthy Store receives 100 tonnes of medicine
∴ There should be 2.75 tonnes of A and 1.5 tonnes from East House, while Heal Store receives
of B so as to minimize the cost. 10 tonnes of medicine from East House and
∴ The minimum cost = 5000(2.75) + 4000(1.5) 40 tonnes of medicine from West House.

Check Yourself (p. 4.52)


18. (a) ∵ Healthy Store receives x tonnes of medicine 1. (a)  (b)  (c) 
from East House.
∴ Healthy Store receives (100 – x) tonnes of 2. Choose (0, 0) as the test point.
medicine from West House. When x = 0 and y = 0,
∵ Heal Store receives y tonnes of medicine from xy=00=0≱1
East House. ∴ The half-plane without the test point (0, 0)
∴ Heal Store receives (50 – y) tonnes of medicine represents the solutions of the inequality.
from West House. ∴ Region II in the figure represents the solutions of
The constraints are: .

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
.

5. Since x and y are non-negative integers, the required


possible pairs are represented by the dots in the figure
(c) Cost of transportation from East House
below.

Cost of transportation from West House

Let $C be the total transportation cost, then

∴ There are 9 pairs of (x, y) satisfying the constraints


∴ The total transportation cost is .
.

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,

∴ The half-plane containing the test point (0, 0)


together with the boundary represents the solutions of
the inequality.

8. The solutions of are represented


by the
shaded region in the figure below.

2. When x = 0 and y = 0,

∴ The half-plane containing the test point (0, 0)


represents the solutions of the inequality.
9. The solutions of are represented by
the shaded region in the figure below.

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
.

(b) (i) Check the values of at the three


vertices.
At (0, 2),
At (1, 1),
4. Choose a point in the shaded region, say (2, 0).
At (2, 4), When and ,
∴ Maximum value of P =
Minimum value of P =

∴ The required inequality is .

5. Choose a point in the shaded region, say (0, 2).


When and ,

141
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

6. Choose a point in the shaded region, say (0, 1).


∴ When and ,
∴ The required inequality is .

∴ The required inequality is .

7. The solutions of are represented


by the shaded region in the figure below.

8. The solutions of are represented by the


shaded region in the figure below.

9. The solutions of are


represented by the shaded region in the figure below.

10. The solutions of are


represented by the shaded region in the figure below.

142
4 Linear Programming

15. The solutions of are represented by the


shaded region in the figure below.

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 .

12. Choose a point in the shaded region, say (1, 2).


∵ x + y + 1 = 1 + 2 + 1 = 2
∴ One inequality is x + y + 1 ≥ 0.
∵ y=2≥1
∴ One inequality is y ≥ 1.
∵ x = 1 ≤ 0
∴ One inequality is x ≤ 0. 17. The solutions of are represented by the shaded
∴ The system of inequalities is
region in the figure below.
.

13. Choose a dot in the figure, say (0, 0).



∴ One inequality is .

∴ One inequality is .

18. The solutions of are represented by the
∴ One inequality is .
∴ The system of inequalities is shaded
region in the figure below.

14. Choose a dot in the figure, say (0, 0).



∴ One inequality is .

∴ One inequality is .

19. The solutions of are represented by
∴ One inequality is .
the shaded region in the figure below.

∴ One inequality is .
∴ The system of inequalities is

143
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

20. The solutions of are represented 25.


by the shaded region in the figure below.

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.

22. The solutions of


are
represented by the
shaded region in the figure below.

From the graph, P attains its maximum at (3, 1).


∴ Maximum value of P
From the graph, P attains its minimum at (1, 3).
∴ Minimum value of P

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 =

24. Check the values of at the four vertices.


At (2, 4), P = 4  3(2) = 10
At (4, 0), P = 0  3(4) = 12
At (3, 2), P = 2  3(3) = 7
At (4, 7), P = 7  3(4) = 5
∴ Maximum value of P =
Minimum value of P =
(b) (i) Check the values of at the three
vertices.
At (2, 6),
At (7, 6),
At (7, 1),
∴ 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 =

28. (a) The solutions of are


represented by the shaded region in the figure below.

(c) Let $P be the profit, then P = 2400x + 2000y.

(b) (i) From the graph, P attains its maximum at (13,


1). ∴ Maximum value of P

From the graph, P attains its minimum at (0, 1).


∴ Minimum value of P

(ii) From the graph, Q attains its maximum at (0, 1).


∴ Maximum value of Q

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:

After simplification, we have:

(c) Let $C be the daily income of Michael, then (b)


C = 180x + 210y.

From the graph, C attains its maximum at (6.7, 3.3).


∴ Michael should spend 6.7 hours on advertisement
design and 3.3 hours on web-page design.
∴ His maximum daily income

145
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

(c) Let $C be the cost, then C = 200x + 220y. (b)

From the graph, C attains its minimum at (6, 5).


∴ Machines P and Q should operate for 6 hours (c) Let $C be the cost, then C = 160x + 75y.
and 5 hours per day respectively so as to
minimize the cost.

32. (a) The constraints are:

After simplification, we have:

(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

34. (a) The constraints are:

After simplification, we have:


(c) Let $P be the profit, then P = 240x + 300y.

(b)

From the graph, P attains its maximum at (12, 8).


∴ The farmer should buy 12 lambs and 8 calves.
∴ The maximum profit
(c) Let $C be the cost, then C = 200x + 50y.

33. (a) The constraints are:

After simplification, we have:

146
4 Linear Programming

From the graph, C attains its minimum at (0.6, 0.4). (b)


∴ The customer should take 0.6 kg of food P and
0.4 kg of food Q daily.
∴ The minimum cost

35. (a) The constraints are:

After simplification, we have:

(b)
(c) Let $P be the profit, then P = 8x + 6y.

From the graph, P attains its maximum at (30, 130).


∴ 30 boxes of brand A medicine and 130 boxes of
brand B medicine should be stocked.
(c) Let $P be the profit, then P = 20 000x + 40 000y. ∴ The maximum profit

Level 2
37. (a) The solutions of are
represented by the shaded region in the figure below.

From the graph, P attains its maximum at (20, 91).


∴ The owner should construct 20 shops A and
91 shops B.

36. (a) The constraints are: (b) Mark the given points on the graph as shown below.

After simplification, we have:

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) Mark the given points on the graph as shown below.

(b) (i)

From the graph, B(2, 2) and D(3.6, 1.2) satisfy the


system of inequalities in (a).

39. (a)

(ii) Number of seats

42. (a) ∵ The solutions lie on the right of x = 0.


∴ One inequality is x ≥ 0.
∵ The solutions lie on the upper half-plane of y = 0.
(b) Since x and y are integers, the required possible pairs ∴ One inequality is y ≥ 0.
are represented by the dots in the figure below. Choose a point in the shaded region, say (0, 0).
∵ x+y=0+0=0≤5
∴ One inequality is x + y ≤ 5.
∵ 2x  y + 2 = 2(0)  0 + 2 = 2 ≥ 0
∴ One inequality is 2x  y + 2 ≥ 0.
∴ The system of inequalities is
.

(b) By substituting y = 0 into , we have


∴ There are 12 pairs of (x, y) which satisfy the
system of inequalities
. ∴ Coordinates of A

40. (a)

(b) Since x and y are integers and the 9 ordered pairs


must lie on the right half-plane of x = p.

148
4 Linear Programming

By substituting x = 1 into (1), we have (ii) Check the values of at the


three
vertices.
At (0, 4), P = –2(0) + 4 + 1 = 5
∴ Coordinates of B
At (6, 8), P = –2(–6) + (8) + 1 = 5
By substituting x = 0 into (2), we have At (6, 0), P = –2(6) + 0 + 1 = –11
∴ Maximum value of P =
Minimum value of P =
∴ Coordinates of C
44. (a) The solutions of
(c) Check the values of P = 4x + y at the four vertices. are represented by the
At O(0, 0), shaded region in the figure below.
At A(5, 0),
At B(1, 4),
At C(0, 2),
∴ Maximum value of P
Minimum value of P

43. (a) (i) By substituting y = 0 into equation of L2,


we have
(b) Since x and y are integers, the feasible solutions are
the points indicated by the dots in the figure.

∴ The coordinates of R are (6, 0).


By substituting x = 0 into the equation of L2,
we have

∴ The coordinates of Q are (0, 4).

(ii) ∵ L1 passes through P and R.


∴ The equation of L1: From the graph, P attains its maximum at (1, 3).
∴ The maximum value of P

45. (a) The solutions of


are
represented by the shaded region in the figure below.

∵ L3 passes through P and Q.


∴ The equation of L3:

(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

NSS Mathematics in Action (2nd Edition) 5A Full Solutions

(ii) From the graph, C attains its minimum at (1.2, 4).


∴ 1.2 kg of substance A and 4 kg of substance B
should be mixed.
∴ The minimum cost

47. (a) The constraints are:

After simplification, we have:

(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

46. (a) The constraints are:


(c) Let N be the total number of seats provided,
then N = 4x + 8y.
After simplification, we have:

(b)

From the graph, N attains its maximum at (3, 4).


∴ Tom should buy 3 small tables and 4 large
tables.
∴ The maximum number of seats

(c) Let $C be the cost, then C = 10x + 8y.


48. (a) The constraints are:

After simplification, we have:

150
4 Linear Programming

(b) (c) Let $P be the profit, then P = 30 000x + 20 000y.

From the graph, P attains its maximum at (2, 8).


∴ The manufacturer should produce 2 jeeps and
8 motorcycles each day.
(c) Let $P be the profit, then P = 80x + 120y. ∴ The maximum profit

50. (a) The constraints are:

After simplification, we have:

(b)

From the graph, P attains its maximum at (14, 13).


∴ The bakery should make 14 kg of cakes and
13 kg of cookies daily.
∴ The maximum profit

49. (a) The constraints are:

After simplification, we have:


(c) Let $C be the cost, then C = 100x + 80y.

(b)

From the graph, C attains its minimum at (10, 15).


∴ The minimum daily operation cost

151
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

51. (a) ∵ x tonnes of coal are sent from P to A. (b)


∴ (20 – x) tonnes of coal are sent from Q to A.
∵ y tonnes of coal are sent from P to B.
∴ (15 – y) tonnes of coal are sent from Q to B.
The constraints are:

After simplification, we have:

(b)

(c) Let $C be the cost, then


.

(c) Cost of transporting coal to company A

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

(d) Since the route to the quake-stricken region might be


blocked, the best way to avoid delay would be to use
helicopters.
Therefore, 50 helicopters and no transport-troops
should be used.
The cost = $17 000 × 50 =
(or any other reasonable answers)

Multiple Choice Questions (p. 4.64)


1. Answer: C
∵ The slope of the line y = x + 5 is 1.
∴ The line slopes downwards.
From the graph, C attains its minimum at (5, 15). Choose (0, 0) as the test point.
∴ The minimum transportation cost When x = 0 and y = 0,
x + 5 = (0) + 5 = 5 ≮ 0
∴ The half-plane without the test point (0, 0) represents
the solutions of the inequality.
52. (a) The constraints are:

After simplification, we have:

2. Answer: B
∵ The straight line passes through (3, 0) and (0, 3).
∴ Equation of the straight line:

152
4 Linear Programming

Choose a point in the shaded region, say (3, 3).


When x = 3 and y = 3,

∴ 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
xy=10=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
.

∴ II may not be true.


∵ The shaded region is in the upper half-plane of

, i.e. .

∴ III must be true.


∴ The answer is C.

153
NSS Mathematics in Action (2nd Edition) 5A Full Solutions

8. Answer: C Exam Focus


Since x and y are integers, the required possible pairs are
represented by the dots in the figure below. Exam-type Questions (p. 4.68)

1. (a) ∵ The x-intercept and the y-intercept of L1 are both


equal to 4.
∴ Equation of L1:

∴ There are 7 ordered pairs (x, y) which satisfy the


system of inequalities.

9. Answer: C

∴ Slope of L
By substituting (2) into (1), we have

∵ L2 passes through (2, 1).


∴ Equation of L2:
By substituting x = 2 into (2), we have

∴ The intersection of L1 and L2 is (2, 7).


By substituting x = 0 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), .

At (2, 7), (c)


∴ Maximum value of P =

10. Answer: A By substituting (3) into (1), we have


Check the values of C = px + qy – 2 at the four vertices.
At (p, q), C = p(p) + q(q) – 2 =  p2  q2  2
At (q, p), C = p(q) + q(p) – 2 = 2 ∴ One of the vertices is (5, 1).
At (p, q), C = p(p) + q(q) – 2 = p2 + q2  2 (2)  (1):
At (p, q), C = p(p) + q(q) – 2 = p2 + q2  2
∵ p2 > 0 and q2 > 0
∴  p2  q2  2 is the minimum.
∴ C attains its minimum at (p, q). By substituting x = 1.5 into (1), we have

∴ One of the vertices is (1.5, 2.5).


Check the values of P = x + 2y at the three vertices.
At (5, 1), P = 5 + 2(1) = 3
At (2, 1), P = 2 + 2(1) = 4
At (1.5, 2.5), P = 1.5 + 2(2.5) = 6.5
∴ The maximum value of P is 6.5.
∴ Michael’s claim is correct.

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.

is the solution of the inequality


.
∴ Regions IV and VI represent the solution of
.

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.

(ii) The factory requires at least 200 units of the


plastic, therefore,

supplier A has to provide at least

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

7. Answer: C 3. (a) When D = 1,


By substituting x = 0 into equation of L1, we have the daily profit, P = 15x + (25  1)y
= 15x + 24y

∴ One of the vertices is (0, 3).


By substituting y = 0 into equation of L2, we have

∴ One of the vertices is (4, 0).

(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:

After simplification, we have:

2. Let the daily profit be $P, then P = 15x + 25y.

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.

156
4 Linear Programming

157

You might also like