4 Linear Programming

4 Linear Programming Draw the line x + 3 y + 4 = 0 .

x −4 −1 2
Review Exercise 4 (p. 4.4)
y 0 −1 −2
1.

2.
∵ The two straight lines intersect at (−2.5, −0.5).
∴ The solution is x = −2.5 and y = −0.5.

Activity
Activity 4.1 (p. 4.6)

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)

3. Draw the line y = 2 x − 3 .
Value of x + y –1 6
x 2 3 4
2. (a) C, D and F
y 1 3 5 (c) Yes, upper half-plane
Draw the line − x + 2 y = 6 .
3. (a) A, B and E
x 1 3 5 (c) Yes, lower half-plane

y 3.5 4.5 5.5 Activity 4.2 (p. 4.22)

1. 0

2. (a)

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

∴ The solution is x = 4 and y = 5.
3. (a) 1, −1
4. Draw the line x − y + 2 = 0 . 2, −2
3, −3
x −4 −2 0

y −2 0 2 (b) (i) increases

(ii) decreases

4. 3, −3

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

To Learn More (p. 4.11) Quick Practice 4.4 (p. 4.15)

3 x − y < 1
Graphical representation of y ≤ ax + b: Graphical representation of  :
x < 2 y − 2

Quick Practice
Quick Practice 4.5 (p. 4.16)
Quick Practice 4.1 (p. 4.8)
Draw the solid line 3 x − 2 y = 2 . y < 2

(a) Graphical representation of  x − y ≤ 4 :
x 0 2 4 2 x + y ≥ 3

y −1 2 5
When x = 0 and y = 0,
3 x − 2 y = 3(0) − 2(0) = 0 ≤ 2
∴ The half-plane containing the test point (0, 0) together
with the boundary represents the solutions of the
inequality.
Graphical representation of 3x − 2y ≤ 2:

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

Quick Practice 4.2 (p. 4.9)

Draw the dotted line 3 x + 4 y = 12 .
x 0 2 4
y 3 1.5 0
When x = 0 and y = 0,
3x + 4y = 3(0) + 4(0) = 0 ≯ 12 ∴ There are 10 pairs of x and y which satisfy the system
∴ The half-plane without the test point (0, 0) represents the of inequalities in (a).
solutions of the inequality.
Graphical representation of 3x + 4y > 12: Quick Practice 4.6 (p. 4.17)
∵ The shaded region is on the right of the line x = 0 .
∴ One inequality is x ≥ 0 .
∵ The shaded region is below the line y = 4 .
∴ One inequality is y < 4 .
Choose a point in the shaded region, say (0, 0).
When x = 0 and y = 0 ,
x − 2 = 0 − 2 = −2
Quick Practice 4.3 (p. 4.10) y=0
Choose a point in the shaded region, say (2, 0).
∴ The remaining inequality is y ≥ x − 2 .
When x = 2 and y = 0 ,
−2 x + 2 = −2(2) + 2 = −2 y ≥ x − 2

Hence, the required system of inequalities is  y < 4 .
y=0
x ≥ 0
∴ y > −2 x + 2 
∴ The required inequality is y > −2 x + 2 .

116
 4 Linear Programming

Quick Practice 4.7 (p. 4.26) (b)

(a)

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

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

Quick Practice 4.9 (p. 4.30)

From the graph, P attains its maximum at (3, 4). (a)
∴ Maximum value of P = 3(3) − (4) = 5
From the graph, P attains its minimum at (–5, 4).
∴ Minimum value of P = 3(−5) − (4) = −19
Alternative Solution
Check the values of P = 3x − y at the three vertices.
At (3, 4), P = 3(3) − (4) = 5
At (–5, 4), P = 3(−5) − (4) = −19
At (–1, –4), P = 3(−1) − (−4) = 1
∴ The maximum value of P is 5, and the minimum
value of P is –19.
From the graph, P attains its maximum at (4, 1).
Quick Practice 4.8 (p. 4.28) ∴ Maximum value of P = 4(4) + 2(1) + 1 = 19
(a) From the graph, P attains its minimum at (–3.5, –3.5).
∴ Minimum value of P = 4(−3.5) + 2(−3.5) + 1 = −20

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

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

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

Quick Practice 4.10 (p. 4.37) (b)

 x + 2 y ≤ 20

 6 x + 4 y ≤ 60
(a) The constraints are: 
 x≥0
 y ≥ 0
 x + 2 y ≤ 20

 3 x + 2 y ≤ 30
After simplification, we have  .
 x≥0
 y≥0

(b)

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

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

From the graph, C attains its minimum at (30, 30).
∴ Minimum value of C = 15(30) + 20(30) = 1050
∴ 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)

10 x + 15 y ≥ 30

30 x + 30 y ≥ 90
(a) The constraints are: 40 x + 20 y ≥ 100
x ≥ 0

 y ≥ 0
2 x + 3 y ≥ 6

 x + y ≥ 3
After simplification, we have 2 x + y ≥ 5 .
From the graph, P attains its maximum at (5, 7.5). x ≥ 0
∴ Maximum value of P = 240(5) + 200(7.5) = 2700 
∴ The candy shop should produce 5 kg of dark  y ≥ 0
chocolate and 7.5 kg of white chocolate each day to
attain a maximum profit of $2700. (b)

Quick Practice 4.11 (p. 4.39)

 x≤ y

 x + y ≥ 60
(a) The constraints are: 
 x≥0
 y ≥ 0

118
 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.
C = 300 x + 200 y + 500(10 − x) + 300(15 − y )
= 9500 − 200 x − 100 y

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 From the graph, C attains its minimum at (6, 9).
and 100 g of foodstuff B to attain a minimum cost of ∴ The minimum total cost on hiring workers per day
$40. = $[9500 − 200(6) − 100(9)]
= $7400
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 Further Practice
overnight sessions.
Further Practice (p. 4.18)
∵ There are y part-time workers working in the
x + y ≤ 6
daytime. 
∴ There are (15 – y) part-time workers working in 1. (a) Graphical representation of  y > 2 x :
overnight sessions. y < x + 4

The constraints are:
10 − x ≥ 4

15 − y ≥ 4
 x + y ≥ 10
(10 − x) + (15 − y ) ≥ 10

 x and y are non-negative integers.
After simplification, we have:
x ≤ 6

 y ≤ 11
 x + y ≥ 10
 x + y ≤ 15 (b) Since x and y are positive integers, the required
 possible pairs are represented by the dots in the figure
 x and y are non-negative integers.
below.

(b)

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

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

∴ One inequality is x ≥ 0 .
∵ The shaded region is below the line y = 0 .
∴ One inequality is y ≤ 0 .
Choose a point in the shaded region, say (3, 0).
When x = 3 and y = 0 ,
x − 2 y = 3 − 2(0) = 3 ≥ 2
∴ One inequality is x − 2 y ≥ 2 .

119
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 x = 3 and y = 0 , ∴ Maximum value of P = 2(4) + (−0.5) + 0.5 = 8
3 x + 2 y = 3(3) + 2(0) = 9 < 12 From the graph, P attains its minimum at (0, −0.5).
∴ The remaining inequality is 3 x + 2 y < 12 . ∴ Minimum value of P = 2(0) + (−0.5) + 0.5 = 0
Hence, the required system of inequalities is
x − 2 y ≥ 2 (ii) Since x and y are integers, the feasible solutions

3 x + 2 y < 12 are represented by the dots in the figure below.
 .
x ≥ 0
 y ≤ 0

Further Practice (p. 4.30)

1. (a) ∵ The shaded region is on the left of the line
x=3.
∴ One inequality is x ≤ 3 .
∵ The shaded region is above the line y = −2 .
From the graph, P attains its maximum at (3, 0).
∴ One inequality is y ≥ −2 .
∴ Maximum value of P = 2(3) + 0 + 0.5 = 6.5
Choose a point in the shaded region, say (0, 0).
When x = 0 and y = 0 , From the graph, P attains its minimum at (0, 0).
7 x − 6 y = 7(0) − 6(0) = 0 ≥ −9 ∴ Minimum value of P = 2(0) + 0 + 0.5 = 0.5
∴ The remaining inequality is 7 x − 6 y ≥ −9 .
Hence, the required system of inequalities is Exercise
x ≤ 3 Exercise 4A (p. 4.11)

 y ≥ −2 . Level 1
7 x − 6 y ≥ −9 1.


(b) By substituting x = 3 into the equation of L3,

we have:
7(3) − 6 y = −9
y=5
∴ One of the vertices is (3, 5).
By substituting y = −2 into the equation of L3,
we have: 2. Choose (0, 0) as the test point.
7 x − 6(−2) = −9 When x = 0 and y = 0,
x − 2 = 0 − 2 = −2 ≱ 0
x = −3
∴ The half-plane without the test point (0, 0) represents
∴ One of the vertices is (−3, −2).
the solutions of the inequality.
The remaining vertex is (3, −2). Graphical representation of y ≤ x − 2:
Check the values of P = −4x + 3y at the three vertices.
At (−3, −2), P = −4(−3) + 3(−2) = 6
At (3, –2), P = −4(3) + 3(−2) = −18
At (3, 5), P = −4(3) + 3(5) = 3
∴ The maximum value of P is 6, and the minimum
value of P is –18.

2. (a)
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:

(b)

120
 4 Linear Programming

4. Choose (0, 0) as the test point. 8. Draw the dotted line y = 3x + 2.

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

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) 9. Draw the dotted line x = 2y.
represents the solutions of the inequality. Choose (1, 2) as the test point.
Graphical representation of 3x + 2y ≥ 5: When x = 1 and y = 2,
2y = 2(2) = 4 ≮ 1
∴ The half-plane without the test point (1, 2)
represents the solutions of the inequality.

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

When x = 0 and y = 0,
−2x + y − 3 = −2(0) + 0 − 3 = −3 ≯ 0 10. Draw the solid line 2 x − y = 4 .
∴ The half-plane without the test point (0, 0)
Choose (0, 0) as the test point.
represents the solutions of the inequality.
When x = 0 and y = 0,
Graphical representation of −2x + y − 3 > 0:
2x − y = 2(0) − 0 = 0 ≤ 4
∴ The half-plane containing the test point (0, 0)
together with the boundary represents the solutions of
the inequality.

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 Level 2
∴ The half-plane containing the test point (0, 0) 11. Choose a point in the shaded region, say (0, 0).
together with the boundary represents the solutions of When x = 0 and y = 0 ,
the inequality. −3 x − 3 = −3(0) − 3 = −3
y=0
∴ y ≥ −3 x − 3
∴ The required inequality is y ≥ −3 x − 3 .

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

When x = −2 and y = 0 ,
2 x + y = 2(−2) + 0 = −4 < −1
∴ The required inequality is 2 x + y < −1 .

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

When x = 1 and y = 0 ,
4 x − 3 y = 4(1) − 3(0) = 4 > 0
∴ The required inequality is 4 x − 3 y > 0 .

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

14. 3x + 1 ≤ y − 2 18. (a) By substituting x = 4 and y = 0 into y = 3 x + b ,

3 x − y ≤ −3 we have
Draw the solid line 3x – y = −3. 0 = 3(4) + b
Choose (0, 0) as the test point. b = − 12
When x = 0 and y = 0,
3x − y = 3(0) − 0 = 0 ≰ −3 (b) Choose a point in the shaded region, say (0, 0).
∴ The half-plane without the test point (0, 0) When x = 0 and y = 0 ,
represents the solutions of the inequality.
3 x − 12 = 3(0) − 12 = −12
y=0
∴ y > 3 x − 12
∴ The required inequality is y > 3 x − 12 .

(c) When x = 1 and y = −10 ,

3 x − 12 = 3(1) − 12 = −9
y = −10
15. −2 x + 3 y > 3 x − y ∵ y < 3 x − 12
∴ The ordered pair (1, –10) is not a solution of the
5x − 4 y < 0
inequality y > 3 x − 12 .
Draw the dotted line 5x – 4y = 0.
Choose (2, 1) as the test point.
When x = 2 and y = 1, Exercise 4B (p. 4.18)
5x − 4y = 5(2) − 4(1) = 6 ≮ 0 Level 1
∴ The half-plane without the test point (2, 1) 1.
represents the solutions of the inequality.

2.
16. (a) Choose a point in the shaded region, say (0, 0).
2 y − 4 x = 2(0) − 4(0) = 0 ≤ 3
∴ 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, 3.
−2x − 2 = −2(0) − 2 = −2 < 0
∴ The half-plane containing the test point (0, 0)
represents the solutions of the inequality.

4.

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

value of x satisfying the inequality is −1.
∴ The minimum value of h is −1.

122
 4 Linear Programming

5. Choose a point in the shaded region, say (−2, −2). y > 2

∵ −2 x − 3 = −2(−2) − 3 = 1 10. The solutions of  are represented by the
4 x + 3 y < 12
y = −2 shaded region in the figure below.
∴ One inequality is y ≤ −2x − 3.
∵ y = −2 ≥ −3
∴ One inequality is y ≥ −3.
 y ≤ −2 x − 3
∴ The system of inequalities is  .
 y ≥ −3

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

∵ x + 2 = −1 + 2 = 1
y=0 x − y + 1 > 0
∴ One inequality is y < x + 2. 11. The solutions of  are represented by the
2 y − x + 3 ≥ 0
∵ y = 0 > −1
shaded region in the figure below.
∴ One inequality is y > x.
y < x + 2
∴ The system of inequalities is  .
y > x

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
∴ One inequality is x − 2y ≥ 1.
3 x − y ≤ 2 2 x + y ≥ 0
∴ The system of inequalities is  . 12. The solutions of  are represented by the
x − 2 y ≥ 1 3 x − y − 9 ≤ 0
shaded region in the figure below.
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.
x ≥ 1

∴ The system of inequalities is  x + y < 4 . Level 2
x + 3 y ≥ 4 13.


x ≤ 1
9. The solutions of  are represented by the shaded
 y ≤ 3x + 1
region in the figure below.

14.

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

15. Choose a point in the shaded region, say (1, 1). y < x
∵ 2x + 3y = 2(1) + 3(1) = 5 ≤ 6 
19. The solutions of  x + 2 y ≤ 6 are represented by the
∴ One inequality is 2x + 3y ≤ 6. 2 x + y ≥ 2
∵ x+y−1=1+1−1=1≥0 
∴ One inequality is x + y − 1 ≥ 0. shaded region in the figure below.
∵ x=1≥0
∴ One inequality is x ≥ 0.
2 x + 3 y ≤ 6

∴ The system of inequalities is  x + y − 1 ≥ 0 .
x ≥ 0


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

∵ −2x + 18 = −2(4) + 18 = 10
y = −2 2 x − 3 y − 6 > 0
∴ One inequality is y ≤ −2x + 18. 
20. The solutions of 2 x − y > 8 are represented by the
∵ x − 3y = 4 − 3(−2) = 10 > 6 y − x + 6 ≤ 0

∴ One inequality is x − 3y > 6.
shaded region in the figure below.
∵ 4x − y = 4(4) − (−2) = 18 ≥ 12
∴ One inequality is 4x − y ≥ 12.
∵ y = −2 ≤ 0
∴ One inequality is y ≤ 0.
 y ≤ −2 x + 18

x − 3 y > 6
∴ The system of inequalities is  .
4 x − y ≥ 12
 y ≤ 0

x + y ≤ 7 2 x + y < 2
 
17. The solutions of  y > 3 x are represented by the shaded 21. (a) The solutions of  x ≥ 0 are represented by the
y > 2  y > −2
 
region in the figure below. shaded region in the figure below.

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

x − y ≤ 1 are represented by the dots in the figure below.

18. The solutions of  x + 2 y ≤ 4 are represented by the
x > 1

shaded region in the figure below.

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

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

124
 4 Linear Programming

3 x + 4 y − 3 > 0 2. Check the values of P = –2x + y at the three vertices.

 At (0, 4), P = –2(0) + (4) = 4
22. (a) The solutions of 3 x − 4 y + 12 ≥ 0 are represented by
At (0, 0), P = –2(0) + (0) = 0
x ≤ 3
 At (6, 0), P = –2(6) + (0) = –12
the shaded region in the figure below. (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) Since x and y are positive integers, the required (b) P attains its minimum at (–1.5, 1), and the
possible pairs are represented by the dots in the figure corresponding minimum value of P is 1.5.
below.
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.
∴ There are 12 pairs of x and y which satisfy the
3 x + 4 y − 3 > 0 5.

system of inequalities 3 x − 4 y + 12 ≥ 0 .
x ≤ 3


3 x − 2 y + 4 ≥ 0

23. (a) The solutions of 5 x + y − 28 < 0 are represented by
2 x + 3 y − 19 ≥ 0

the shaded region in the figure below.

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

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

6.

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

(5, 3), which lie on 5x + y – 28 = 0, do not satisfy
From the graph, P attains its maximum at (–4, 3).
the inequality 5x + y – 28 < 0.
∴ Maximum value of P = –4(–4) + 2(3) = 22
Exercise 4C (p. 4.31) From the graph, P attains its minimum at (4, –1).
Level 1 ∴ Minimum of P = –4(4) + 2(–1) = −18
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.
(b) P attains its minimum at (–2, –1), and the
corresponding minimum value of P is –5.
125
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.
x − y − 2 ≤ 0

∴ The system of inequalities is  x ≥ −2 .
y ≤ 3


(b) (i) Check the values of P = 3x − y at the three From the graph, P attains its maximum at (2, 5).
vertices. ∴ Maximum value of P = 13
At (5, 3), P = 3(5) − 3 = 12 From the graph, P attains its minimum at (1, 2).
At (–2, 3), P = 3(–2) − 3 = –9 ∴ Minimum value of P = 6
At (–2, –4), P = 3(–2) − (−4) = –2
∴ Maximum value of P = 12
(ii)
Minimum value of P = −9

(ii) Check the values of P = −2x − 5y at the three

vertices.
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 = 24
Minimum value of P = −25

8. (a) Choose a point in the shaded region, say (1, 2). From the graph, P attains its maximum at (0, 5).
∵ 7x + y = 7(1) + 2 = 9 ≥ 5 ∴ Maximum value of P = 15
∴ One inequality is 7x + y ≥ 5.
From the graph, P attains its minimum at (3, 2).
∵ 7x + 4y = 7(1) + 4(2) = 15 ≤ 34 ∴ Minimum value of P = −6
∴ One inequality is 7x + 4y ≤ 34.
3
∵ y = 2 ≥ and y = 2 ≤ 5 x ≥ 0
2 
3 9. (a) The solutions of  y ≥ −4 are represented
∴ One inequality is ≤ y ≤ 5 . 5 x + 4 y − 20 ≤ 0
2 
7 x + y ≥ 5 by the shaded region in the figure below.

3
∴ The system of inequalities is  ≤ y ≤ 5 .
2
7 x + 4 y ≤ 34

(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
At (0, 5), P = 0 + 3(5) = 15
At (7.2, −4), P = 7.2 + 3(−4) = −4.8
∴ Maximum value of P = 15
Minimum value of P = −12
∴ There are 11 pairs of (x, y) which satisfy the
system of inequalities in (a).

126
 4 Linear Programming

−1 ≤ x ≤ 2

10. (a) The solutions of  y ≤ 9 are represented by the
x + y ≥ 6

shaded region in the figure below.

Check the values of P = x − y at the four vertices.

At (0, 0), P = 0 − 0 = 0
At (6, 0), P = 6 + 0 = 6
At (1, 2.5), P = 1 − 2.5 = −1.5
At (0, 2), P = 0 − 2 = −2
∴ Maximum value of P = 6
Minimum value of P = −2

(b) Check the values of P = 4x + y + 2 at the four vertices.

At (−1, 7), P = 4(−1) + 7 + 2 = 5 2 x − y − 6 ≤ 0

At (−1, 9), P = 4(−1) + 9 + 2 = 7 3 x + 4 y − 20 ≤ 0
At (2, 9), P = 4(2) + 9 + 2 = 19 13. The solutions of  are represented by the
At (2, 4), P = 4(2) + 4 + 2 = 14 x ≥ 0
 y ≥ 0
∴ Maximum value of P = 19
shaded region in the figure below.
Minimum value of P = 5

1 ≤ x ≤ 2

11. (a) The solutions of  y ≤ 2 are represented by the
x + 2 y ≥ 3

shaded region in the figure below.

Check the values of P = 2 x + y at the four vertices.

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

Level 2
x − 2 y + 4 ≥ 0

x + 2 y − 6 ≤ 0
12. The solutions of  are represented by the
x ≥ 0
 y ≥ 0
shaded region in the figure below.

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

Check the values of P = −4 x − 3 y + 5 at the four vertices. 2 x − y ≥ 1

At (0, 0), P = −4(0) − 3(0) + 5 = 5 
17. The solutions of 3 x + y ≥ 9 are represented by the
At (0, 4), P = −4(0) − 3(4) + 5 = −7 7 x − y ≤ 21

At (2, 2), P = −4(2) − 3(2) + 5 = −9 shaded region in the figure below.
At (3, 0), P = −4(3) − 3(0) + 5 = −7
∴ Maximum value of P = 5
Minimum value of P = −9

x − y ≥ 0

15. The solutions of  x + y ≥ 2 are represented by the
3 x + y ≤ 12

shaded region in the figure below.

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

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

(ii) For x + y ≥ 4 , P attains its minimum at (0, 4).

∴ Minimum value of P = 5(0) + 3(4) − 6 = 6
For 4 x + 5 y ≥ 20 , P attains its minimum at
(0, 4).
∴ Minimum value of P = 5(0) + 3(4) − 6 = 6

19. (a) The shaded region is the common region of the left
half-plane of L1, the lower half-plane of L2, the upper
Check the values of P = x + y − 3 at the three vertices. half-plane of L3 and the upper half-plane of L4.
At (1, 0), P = 1 + 0 − 3 = −2 x ≤ 9

At (2, 4), P = 2 + 4 − 3 = 3  y ≤ 8
At (5, 6), P = 5 + 6 − 3 = 8 ∴ The system of inequalities is  1 .
y ≥ 3 x
∴ Maximum value of P = 8 
 y ≥ −7 x + 22
Minimum value of P = −2

(b) Coordinates of A = (9, 8)

 L2 : y = 8 (1)

L
 4 : y = − 7 x + 22 (2)
By substituting (1) into (2), we have
8 = −7 x + 22
x=2
∴ Coordinates of B = (2, 8)

128
 4 Linear Programming

 L4 : y = −7 x + 22 (2) By substituting y = 1 into the equation of L2, we have


 1 1= x + 2
 L3 : y = 3 x (3)
 x = −1
From (3), we have ∴ The intersection of L2 and L3 is (−1, 1).
x = 3y ……(4)
By substituting (4) into (2), we have Check the values of P = −3x + 4y at the three vertices.
y = −7(3 y ) + 22 At (2, 4), P = −3(2) + 4(4) = 10
22 y = 22 At (−1, 1), P = −3(−1) + 4(1) = 7
y =1
At (5, 1), P = −3(5) + 4(1) = −11
By substituting y = 1 into (4), we have
x = 3(1) = 3 ∴ Maximum value of P = 10
∴ Coordinates of C = (3, 1)
Minimum value of P = −11
 1
 L3 : y = x (3)
 3 21. (a) Check the values of P = 1 − x − 2y at the three
L : x = 9 (5) vertices.
 1
At (1, 2), P = 1 − 1 − 2(2) = −4
By substituting (5) into (3), we have
1 At (3.5, −0.5), P = 1 − 3.5 − 2(−0.5) = −1.5
y = (9) = 3 At (3.5, 4.5), P = 1 − 3.5 − 2(4.5) = −11.5
3
∴ Coordinates of D = (9, 3) ∴ Maximum value of P = −1.5
Minimum value of P = −11.5
(c) Check the values of P = 2x + y at A, B, C and D
respectively. (b) Since x and y are integers, the feasible solutions
At A(9, 8), P = 2(9) + 8 = 26 are the points indicated by the dots in the figure.
At B(2, 8), P = 2(2) + 8 = 12
At C(3, 1), P = 2(3) + 1 = 7
At D(9, 3), P = 2(9) + 3 = 21
∴ Maximum value of P = 26
Minimum value of P = 7

20. (a) The equation of L2:

y−4
=1
x−2
y−4=x−2
y=x+2 From the graph, P attains its maximum at (3, 0).
∵ L1 ⊥ L2 ∴ Maximum value of P = 1 − 3 − 2(0) = −2
∴ Slope of L1 × slope of L2 = −1 From the graph, P attains its minimum at (3, 4).
Slope of L1 × 1 = −1 ∴ Minimum value of P = 1 − 3 − 2(4) = −10
Slope of L1 = −1
The equation of L1: y +1 ≥ 0
y−4 
22. (a) The solutions of  x − y + 1 ≥ 0 are represented by the
= −1
x−2 x + y ≤ 4

y − 4 = −x + 2 shaded region in the figure below.
y = −x + 6

(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.
 y ≤ −x + 6

∴ The system of inequalities is  y ≤ x + 2 .
y ≥1


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

1 = −x + 6
x=5
∴ The intersection of L1 and L3 is (5, 1).

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

(b) (i) Check the values of P = x + 3 y 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), P = −2 + 3(−1) = −5
At (1.5, 2.5), P = 1.5 + 3(2.5) = 9
At (5, −1), P = 5 + 3(−1) = 2
∴ Maximum value of P = 9
∴ Minimum value of P = −5

(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 = 3(2) + 2(3) − 6
=6
From the graph, P attains its minimum at (–2, –2).
∴ Minimum value of P = 3(−2) + 2(−2) − 6
= − 16

From the graph, P attains its maximum at (2, 2). Exercise 4D (p. 4.44)
∴ Maximum value of P = 2 + 3(2) = 8 Level 1
From the graph, P attains its minimum at (–2, –1).  x + y ≥ 30

∴ Minimum value of P = −2 + 3(−1) = −5 x > y
1. The constraints are: 
x ≥ 0
 y ≥ 0
 y ≥ −2

23. (a) The solutions of  y ≤ 2 x + 2 are represented by
4 y ≤ −14 x + 41 4 x + 6 y ≤ 150
 
the shaded region in the figure below. 2. The constraints are:  x + y ≤ 20
 x and y are non-negative integers.

After simplification, we have:
2 x + 3 y ≤ 75

 x + y ≤ 20
 x and y are non-negative integers.


6 x + 8 y ≥ 160

3. The constraints are: 4 x + 2 y ≥ 90
 x and y are non-negative integers.

After simplification, we have:
3 x + 4 y ≥ 80
(b) (i) Check the values of P = 3 x + 2 y − 6 at the three 
2 x + y ≥ 45
vertices.  x and y are non-negative integers.

At (−2, −2), P = 3(−2) + 2(−2) − 6 = −16
At (1.5, 5), P = 3(1.5) + 2(5) − 6 = 8.5
2 x + 5 y ≤ 100
At (3.5, −2), P = 3(3.5) + 2(−2) − 6 = 0.5 
 14 30
∴ Maximum value of P = 8.5 4. The constraints are:  x + y≥7
 60 60
Minimum value of P = −16  x and y are non-negative integers.
After simplification, we have:
2 x + 5 y ≤ 100

7 x + 15 y ≥ 210
 x and y are non-negative integers.


130
 4 Linear Programming

 4 x + 4 y ≤ 3200 (c) Let $P be the profit, then P = 500x + 400y.


 5 x + 3 y ≤ 3000
5. (a) The constraints are: 
 x≥0
 y ≥ 0
After simplification, we have:
 x + y ≤ 800

 5 x + 3 y ≤ 3000

 x≥0
 y ≥ 0
From the graph, P attains its maximum at (350, 800).
∴ The factory should produce 35 kg of
(b)
healthy food A and 80 kg of healthy food B.
∴ The maximum profit = $[500(350) + 400(800)]
= $495 000

32 x + 8 y ≥ 160

x ≤ y
7. (a) The constraints are: 
x ≥ 0
 y ≥ 0
After simplification, we have:
4 x + y ≥ 20

(c) Let $P be the profit, then P = 300x + 200y. x ≤ y

x ≥ 0
 y ≥ 0

(b)

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 = $[300(300) + 200(500)]
= $190 000

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

 80 x + 90 y ≤ 100 000

 20 x + 10 y ≤ 15 000
6. (a) The constraints are: 
 x≥0
 y ≥ 0
After simplification, we have:
 8 x + 9 y ≤ 10 000

 2 x + y ≤ 1500

 x≥0
 y ≥ 0

(b)

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 = $[500(4) + 180(4)]
= $2720

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

8. (a) The constraints are: From the graph, C attains its minimum at (10, 3).
6 x + 2 y ≤ 24 ∴ The company should hire 10 buses A and
 3 buses B.
4 x + 2 y ≤ 20
 x and y are non-negative integers. ∴ The minimum cost = $[450(10) + 600(3)]

After simplification, we have: = $6300
3 x + y ≤ 12
 Level 2
2 x + y ≤ 10
 x and y are non-negative integers. 10. (a) The constraints are:
 50 x + 60 y ≤ 800

(b) 50 x + 40 y ≤ 600

x ≥ 0
 y ≥ 0
After simplification, we have:
5 x + 6 y ≤ 80

5 x + 4 y ≤ 60

x ≥ 0
 y ≥ 0

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

(b)

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

∴ The carpenter should make 2 tables and 6 chairs.
∴ The maximum profit = $[2000(2) + 800(6)]
= $8800

9. (a) The constraints are: (c) Let $C be the profit from selling each vaccine.
Total profit of selling vaccines = $C(x + y)
30 x + 50 y ≥ 450

600 x + 300 y ≥ 6000
 x and y are non-negative integers.

After simplification, we have:
3 x + 5 y ≥ 45

2 x + y ≥ 20
 x and y are non-negative integers.


(b)

From the graph, the total profit attains its maximum

at (4, 10).
(c) Let $C be the cost, then C = 450x + 600y. ∴ 4 kg of vaccine A and 10 kg of vaccine B should
be produced.

132
 4 Linear Programming

11. (a) The constraints are: (b)

2 x + y ≥ 9

 x + y ≥ 7
 x + 2 y ≥ 10
x ≥ 0

 y ≥ 0

(b)

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

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

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

∴ 40 chocolate eggs and 300 chocolate rabbits
should be made.
∴ The maximum profit = $[4(40) + 3(300)]
= $1060

From the graph, C attains its minimum at (4, 3). 13. (a) The constraints are:
∴ 4 kg of food P and 3 kg of food Q are required 1000 x + 1000 y ≤ 80 000
to minimize the cost. 
1000 x ≥ 10 000
Total weight of the mixture = (4 + 3) kg = 7 kg 
4 3 1000 y ≥ 20 000
∴ There should be kg of food P and kg of 1000 y ≤ 3(1000 x)
7 7
food Q in each kg of the mixture so as to After simplification, we have:
minimize the cost.  x + y ≤ 80

 x ≥ 10
12. (a) The constraints are: 
25 x + 10 y ≤ 4000  y ≥ 20
  y ≤ 3 x
25 x + 20 y ≤ 7000

40 x + 5 y ≤ 4000 (b)
 x and y are non-negative integers.
After simplification, we have:
5 x + 2 y ≤ 800

5 x + 4 y ≤ 1400

8 x + y ≤ 800
 x and y are non-negative integers.

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

(c) Let $P be the earnings from 1000 m2 of land for After simplification, we have:
growing soybeans, then the earnings for growing 9 x + 5 y ≤ 100
corns are $2P. 
Total earnings = $(2Px + Py) = $P(2x + y) 12 x + 15 y ≤ 200
x ≤ 8
 y ≤ 10

 x and y are non-negative integers.

(b)

From the graph, the total earnings attain its maximum

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:

3 x + 2 y ≤ 60
 (c) Let $P be the profit, then
 x + 2 y ≤ 48
 P = 2(180 x) + 3(120 x) + 2(100 y ) + 3(150 y )
 x + y ≤ 25
 x and y are non-negative integers. = 720 x + 650 y

(b)

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

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

∴ Maximum value of P = 720(7) + 650(7) = 9590
Number of magnets should be produced
=180(7) + 100(7) = 1960
Number of key holders should be produced
= 120(7) + 150(7) = 1890
∴ The factory should produce 1960 magnets and
1890 key holders each day to attain a maximum
profit of $9590.
From the graph, P attains its maximum at (10, 15).
∴ There should be 10 pairs of shoes and 15 pairs 16. (a) The constraints are:
of boots. 0.8 x + 0.6 y ≥ 2

∴ The maximum profit = $[90(10) + 75(15)] 0.2 x + 0.4 y ≤ 1
= $2025 x + y ≤ 4
x ≥ 0

15. (a) The constraints are:  y ≥ 0
180 x + 100 y ≤ 2000 After simplification, we have:

120 x + 150 y ≤ 2000 4 x + 3 y ≥ 10

x ≤ 8  x + 2 y ≤ 5
 y ≤ 10
 x + y ≤ 4
 x and y are non-negative integers. x ≥ 0

 y ≥ 0

134
 4 Linear Programming

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

C = 5000x + 4000y.

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

From the graph, C attains its minimum at (2.75, 1.5).
∴ There should be 2.75 tonnes of A and 1.5 tonnes
of B so as to minimize the cost.
∴ The minimum cost = 5000(2.75) + 4000(1.5)
= $19 750

18. (a) ∵ Healthy Store receives x tonnes of medicine

from East House.
∴ Healthy Store receives (100 – x) tonnes of
medicine from West House.
∵ Heal Store receives y tonnes of medicine from
East House.
From the graph, C attains its minimum at (1, 2). ∴ Heal Store receives (50 – y) tonnes of medicine
∴ 1 kg of concrete mix A and 2 kg of concrete mix from West House.
B should be mixed. The constraints are:
∴ The minimum cost = $[50(1) + 35(2)]  x + y ≤ 140
= $120 
(100 − x) + (50 − y ) ≤ 40

0 ≤ x ≤ 100
17. (a) The constraints are: 0 ≤ y ≤ 50
200 x + 300 y ≥ 1000
 After simplification, we have:
200 x + 100 y ≥ 700  x + y ≤ 140
150 x + 50 y ≥ 400 
x ≥ 0  x + y ≥ 110

 0 ≤ x ≤ 100
 y ≥ 0 0 ≤ y ≤ 50
After simplification, we have:
2 x + 3 y ≥ 10 (b)

2 x + y ≥ 7
3 x + y ≥ 8
x ≥ 0

 y ≥ 0

(b)

(c) Cost of transportation from East House

= $(60 x + 80 y )
Cost of transportation from West House
= $[30(100 − x) + 20(50 − y )]
= $(4000 − 30 x − 20 y )
Let $C be the total transportation cost, then
C = (60 x + 80 y ) + (4000 − 30 x − 20 y )
= 30 x + 60 y + 4000
∴ The total transportation cost is
$(30 x + 60 y + 4000) .

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

(d) 6. The solutions of y ≤ x − 4 are represented by the shaded

region in the figure below.

7. The solutions of 2 x − y + 1 > 0 are represented by the

From the graph, C attains its minimum at (100, 10). shaded region in the figure below.
∴ Healthy Store receives 100 tonnes of medicine
from East House, while Heal Store receives
10 tonnes of medicine from East House and
40 tonnes of medicine from West House.

Check Yourself (p. 4.52)

1. (a)  (b)  (c) 

2. Choose (0, 0) as the test point. 2 x + 3 y ≥ 6

When x = 0 and y = 0, 8. The solutions of  are represented by the
x−y=0−0=0≱1 x − 2 y ≤ 0
∴ The half-plane without the test point (0, 0) shaded region in the figure below.
represents the solutions of the inequality.
∴ Region II in the figure represents the solutions of
x − y ≥1.

3. When x = 0 and y = 0,
2x + 3 = 2(0) + 3 = 3
y=0
∴ y ≤ 2x + 3
∴ The shaded region in the figure represents the x + 3 y < 3
9. The solutions of  are represented by the
solutions of the inequality y ≤ 2x + 3. 3 x + 2 y ≥ 2
shaded region in the figure below.
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
10. (a) Choose a point in the shaded region, say (0, 0).
x ≥ 2 ∵ x+y+2=0+0+2=2
 .
x + 2 y ≤ 6 ∴ One inequality is x + y + 2 ≥ 0.
∵ 3x − y + 2 = 3(0) − 0 + 2 = 2
5. Since x and y are non-negative integers, the required ∴ One inequality is 3x − y + 2 ≥ 0.
possible pairs are represented by the dots in the figure ∵ 3x + y − 2 = 3(0) + 0 − 2 = −2
below. ∴ One inequality is 3x + y − 2 ≤ 0.
x + y + 2 ≥ 0

∴ The system of inequalities is 3 x − y + 2 ≥ 0 .
3 x + y − 2 ≤ 0


(b) (i) Check the values of P = x + 2 y at the three

∴ There are 9 pairs of (x, y) satisfying the constraints vertices.
x + 3 y < 9 At (0, 2), P = 0 + 2(2) = 4
 . At (−1, −1), P = −1 + 2(−1) = −3
y ≥ 1
At (2, −4), P = 2 + 2(−4) = −6
∴ Maximum value of P = 4
Minimum value of P = −6

136
 4 Linear Programming

(ii) Check the values of P = −2 x + y − 1 at the three 6. Choose a point in the shaded region, say (0, 1).
vertices. When x = 0 and y = 1 ,
At (0, 2), P = −2(0) + 2 − 1 = 1 −2 x − 3 y + 4 = −2(0) − 3(1) + 4 = 1 > 0
At (−1, −1), P = −2(−1) + (−1) − 1 = 0 ∴ −2 x − 3 y + 4 > 0
At (2, −4), P = −2(2) + (−4) − 1 = −9 ∴ The required inequality is −2 x − 3 y + 4 > 0 .
∴ Maximum value of P = 1
Minimum value of P = −9  x − y > −1
7. The solutions of  are represented by the
x + y ≥ 3
shaded region in the figure below.
Revision Exercise 4 (p. 4.54)
Level 1
1. When x = 0 and y = 0,
x − 1 = 0 − 1 = −1 ≤ 0
∴ The half-plane containing the test point (0, 0)
together with the boundary represents the solutions of
the inequality.

 y ≥ 3x
8. The solutions of  are represented by the
x + 2 y < 2
2. When x = 0 and y = 0,
shaded region in the figure below.
−2 x + 4 = −2(0) + 4 = 4 > 0
∴ The half-plane containing the test point (0, 0)
represents the solutions of the inequality.

3. When x = 0 and y = 0,
3x − 2y = 3(0) + 2(0) = 0 ≥ −1
x − y − 6 < 0
∴ The half-plane containing the test point (0, 0) 
together with the boundary represents the solutions of 9. The solutions of  x ≥ 1 are represented by the
the inequality.  y ≥ −2

shaded region in the figure below.

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

When x = −2 and y = 0 ,
− x = −(−2) = 2
y=0
∴ y < −x
∴ The required inequality is y < − x . y ≥ 2

10. The solutions of 3 x − 2 y ≥ −6 are represented by the
5. Choose a point in the shaded region, say (0, 2). 9 x + 4 y ≤ 27

When x = 0 and y = 2 , shaded region in the figure below.
x − 2 y = 0 − 2(2) = −4 ≤ −3
∴ x − 2 y ≤ −3
∴ The required inequality is x − 2 y ≤ −3 .

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

15. The solutions of y > −5 x + 3 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 4 x − 3 y < 12 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.
y ≤ x + 3
∴ The system of inequalities is  .
 y > 6 − 3x

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. 17. The solutions of 2 x ≤ 3 y are represented by the shaded
∵ x = −1 ≤ 0 region in the figure below.
∴ One inequality is x ≤ 0.
x + y + 1 ≥ 0

∴ The system of inequalities is  y ≥ 1 .
x ≤ 0


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

∵ x = 0 > −2
x
∴ One inequality is x > −2 . 18. The solutions of + y ≤ 1 are represented by the shaded
∵ x + 2 y = 0 + 2(0) = 0 ≤ 2 2
region in the figure below.
∴ One inequality is x + 2 y ≤ 2 .
∵ 2 x − 2 y = 2(0) − 2(0) = 0 < 1
∴ One inequality is 2 x − 2 y < 1 .
 x > −2

x + 2 y ≤ 2
∴ The system of inequalities is 
2 x − 2 y < 1
 x and y are integers.
x + 3 y ≥ 2
19. The solutions of  are represented by the
14. Choose a dot in the figure, say (0, 0). x + y ≥ 1
∵ 2 x − 3 y = 2(0) − 3(0) = 0 ≥ −6 shaded region in the figure below.
∴ One inequality is 2 x − 3 y ≥ −6 .
∵ 4 x + y = 4(0) + 0 = 0 ≤ 7
∴ One inequality is 4 x + y ≤ 7 .
∵ 2 x + y = 2(0) + 0 = 0 > −2
∴ One inequality is 2 x + y > −2 .
∵ x − 3 y = 0 − 3(0) = 0 < 5
∴ One inequality is x − 3 y < 5 .
2 x − 3 y ≥ −6

4 x + y ≤ 7
∴ The system of inequalities is 2 x + y > −2
x − 3 y < 5

 x and y are integers.

138
 4 Linear Programming

3 x − 2 y < 6 25.
20. The solutions of  are represented by the
4 x + y > 3
shaded region in the figure below.

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

∴ Maximum value of P = 3(4) + 2(3) = 18

x − y + 3 ≥ 0 From the graph, P attains its minimum at (1, 1).

 ∴ Minimum value of P = 3(1) + 2(1) = 5
21. The solutions of  x − y − 1 ≥ 0 are represented by the
y ≥ 0

26.
shaded region in the figure below.

2 x + 4 y − 3 ≤ 0
 From the graph, P attains its maximum at (3, 1).
22. The solutions of 2 x + 3 y + 4 ≥ 0 are represented by the
 x ≥ −3 ∴ Maximum value of P = 2(3) − 3(1) + 8 = 11

shaded region in the figure below. From the graph, P attains its minimum at (1, 3).
∴ Minimum value of P = 2(1) − 3(3) + 8 = 1

x ≤ 7

27. (a) The solutions of  y ≤ 6 are represented by the
x + y − 8 ≥ 0

shaded region in the figure below.

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

At (−2, 9), P = –2 + 3(9) = 25
At (1, 3), P = 1 + 3(3) = 10
At (4, 6), P = 4 + 3(6) = 22
∴ Maximum value of P = 25
Minimum value of P = 10

24. Check the values of P = y − 3 x 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 (b) (i) Check the values of P = x + 2 y at the three
∴ Maximum value of P = 12 vertices.
At (2, 6), P = 2 + 2(6) = 14
Minimum value of P = −7
At (7, 6), P = 7 + 2(6) = 19
At (7, 1), P = 7 + 2(1) = 9
∴ Maximum value of P = 19
Minimum value of P = 9

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

(ii) Check the values of Q = −3 x + y at the three 30. (a) The constraints are:
vertices. 3 x + 2 y ≤ 40
At (2, 6), P = −3(2) + 6 = 0 
 x + 2 y ≤ 24
At (7, 6), P = −3(7) + 6 = −15  x and y are non-negative integers.

At (7, 1), P = −3(7) + 1 = −20
∴ Maximum value of P = 0 (b)
Minimum value of P = −20

y ≤ 1

28. (a) The solutions of  x + y ≥ 1 are represented by the
x − 5 y ≤ 8

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 = 13 − 2(1) = 11
From the graph, P attains its minimum at (0, 1).
∴ Minimum value of P = 0 − 2(1) = −2

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

∴ Maximum value of Q = −2(0) − 1 = −1
From the graph, Q attains its minimum at (13, 1).
∴ Minimum value of Q = −2(13) − 1 = −27 From the graph, P attains its maximum at (8, 8).
∴ 8 clay sculptures and 8 wood sculptures should
29. (a) The constraints are: be produced per week.
x ≥ 2 y ∴ The maximum profit = $[2400(8) + 2000(8)]

 x + y ≤ 10 = $35 200

x ≥ 0
 y ≥ 0 31. (a) The constraints are:
100 x + 80 y ≥ 1000
(b) 
100 x + 120 y ≥ 1200

x ≥ 0
 y ≥ 0
After simplification, we have:
5 x + 4 y ≥ 50

5 x + 6 y ≥ 60

(c) Let $C be the daily income of Michael, then x ≥ 0
C = 180x + 210y.  y ≥ 0

(b)

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
= $[180(6.7) + 210(3.3)]
= $1899

140
 4 Linear Programming

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

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

32. (a) The constraints are:

450 x + 750 y ≤ 11 400

 x + y ≤ 20
 x and y are non-negative integers.

After simplification, we have:
3 x + 5 y ≤ 76
 From the graph, C attains its minimum at (3, 5).
 x + y ≤ 20 ∴ The lorry should make 3 rounds of delivery and
 x and y are non-negative integers.
 the van should make 5 rounds of delivery.
∴ The minimum cost = $[160(3) + 75(5)]
(b) = $855

34. (a) The constraints are:

240 x + 40 y ≥ 160

180 x + 60 y ≥ 132

x ≥ 0
 y ≥ 0
After simplification, we have:
6 x + y ≥ 4
(c) Let $P be the profit, then P = 240x + 300y. 
15 x + 5 y ≥ 11

x ≥ 0
 y ≥ 0

(b)

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

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

33. (a) The constraints are:

50 x + 20 y ≥ 250

y ≥ x
 x and y are non-negative integers.

After simplification, we have:
5 x + 2 y ≥ 25

y ≥ x
 x and y are non-negative integers.


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

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 = $[200(0.6) + 50(0.4)]
= $140

35. (a) The constraints are:

45 x + 100 y ≤ 10 000

 x ≤ 20
 x and y are non-negative integers.

After simplification, we have:
9 x + 20 y ≤ 2000 (c) Let $P be the profit, then P = 8x + 6y.

 x ≤ 20
 x and y are non-negative integers.


(b)

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.
∴ The maximum profit = $[8(30) + 6(130)]
= $1020

(c) Let $P be the profit, then P = 20 000x + 40 000y. Level 2

y ≤ x

37. (a) The solutions of  x + 3 y ≥ 3 are represented by the
x + 2 y ≥ 4

shaded region in the figure below.

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

∴ The owner should construct 20 shops A and (b) Mark the given points on the graph as shown below.
91 shops B.

36. (a) The constraints are:

0.2 x + 0.3 y ≤ 45

0.7 x + 0.3 y ≤ 60
 x and y are non-negative integers.

After simplification, we have:
2 x + 3 y ≤ 450

7 x + 3 y ≤ 600
 x and y are non-negative integers. From the graph, C(2, 2), D(3, 1) and E(7, –1) satisfy

the system of inequalities in (a).

142
 4 Linear Programming

2 x − y ≤ 6 (b) Since x and y are integers and the 9 ordered pairs

 must lie on the right half-plane of x = p.
38. (a) The solutions of 3 x + 2 y ≥ 8 are represented by the
Therefore, from the graph, p can be any value in the
x + 2 y ≤ 6
 range 4 < p ≤ 5 .
shaded region in the figure below.
2 ≤ x ≤ 4

41. (a) The solutions of 5 ≤ y ≤ 9 are represented by the
2 x + y > 11

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 = 29 × 2 + 11 × 4

= 102

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

(b) Since x and y are integers, the required possible pairs ∴ One inequality is x ≥ 0.
are represented by the dots in the figure below. ∵ The solutions lie on the upper half-plane of y = 0.
∴ One inequality is y ≥ 0.
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.
x ≥ 0

y ≥ 0
∴ There are 12 pairs of (x, y) which satisfy the ∴ The system of inequalities is  .
x + y ≤ 5
y < 4 2 x − y + 2 ≥ 0

system of inequalities  x + 2 y ≥ 8 .
2 x + y ≤ 16
 (b) By substituting y = 0 into L3 : x + y = 5 , we have
x+0 =5
40. (a)
x=5
∴ Coordinates of A = (5, 0)

 L3 : x + y = 5 (1)

 L4 : 2 x − y + 2 = 0 (2)
(1) + (2) : 3 x + 2 = 5
x =1

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

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

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

we have
2 x + 3(0) = 12
(b) Since x and y are integers, the feasible solutions are
x=6 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
2(0) + 3 y = 12
y=4
∴ The coordinates of Q are (0, 4).

(ii) ∵ L1 passes through P and R.

∴ The equation of L1:
y − (−8) 0 − (−8) From the graph, P attains its maximum at (1, 3).
= ∴ The maximum value of P = 5(1) + 3(3)
x − (−6) 6 − (−6)
y +8 8 = 14
=
x + 6 12
y ≤ 5
3 y + 24 = 2 x + 12 
2 x − 3 y = 12 2 y ≤ x + 8
45. (a) The solutions of  are represented by
∵ L3 passes through P and Q. 3x + 5 y ≥ 20
 y ≥ 4 x − 19
∴ The equation of L3:
y − (−8) 4 − (−8) the shaded region in the figure below.
=
x − (−6) 0 − (−6)
y + 8 12
=
x+6 6
y + 8 = 2 x + 12
2 x − y = −4

(b) (i) Choose a point in the shaded region, say (0, 0).
∵ 2x − 3y = 2(0) − 3(0) = 0 ≤ 12
∴ One inequality is 2x − 3y ≤ 12.
∵ 2x + 3y = 2(0) + 3(0) = 0 ≤ 12
∴ One inequality is 2x + 3y ≤ 12.
∵ 2x − y = 2(0) − 0 = 0 ≥ −4 (b) (i) Check the values of P = −7x + 4y at the four
∴ One inequality is 2x − y ≥ −4. vertices.
∴ The system of inequalities is At (0, 4), P = −7(0) + 4(4) = 16
At (2, 5), P = −7(2) + 4(5) = 6
2 x − 3 y ≤ 12
 At (6, 5), P = −7(6) + 4(5) = −22
2 x + 3 y ≤ 12 . At (5, 1), P = −7(5) + 4(1) = −31
2 x − y ≥ −4 ∴ Maximum value of P = 16

Minimum value of P = −31

144
 4 Linear Programming

(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 = $[10(1.2) + 8(4)]
= $44

47. (a) The constraints are:

200 x + 250 y ≤ 1700

1.2 x + 1.8 y ≤ 10.8

x ≥ 3
 x and y are non-negative integers.
After simplification, we have:
Check the values of P = −7x + 4y at the four
vertices. 4 x + 5 y ≤ 34

At (0, 4), P = 16 2 x + 3 y ≤ 18
At (4, 6), P = −7(4) + 4(6) = −4 
x ≥ 3
At (6, 5), P = −22  x and y are non-negative integers.
At (5, 1), P = −31
∴ Maximum value of P = 16
(b)
Minimum value of P = −31

46. (a) The constraints are:

5 x + 3 y ≥ 18

2 x + 4 y ≥ 14
5 x + 6 y ≥ 30
x ≥ 0

 y ≥ 0
(c) Let N be the total number of seats provided,
After simplification, we have: then N = 4x + 8y.
5 x + 3 y ≥ 18
x + 2 y ≥ 7

5 x + 6 y ≥ 30
x ≥ 0

 y ≥ 0

(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 = 4(3) + 8(4)
= 44

48. (a) The constraints are:

20 x + 15 y ≤ 500
(c) Let $C be the cost, then C = 10x + 8y. 
 x + 2 y ≤ 40
 x + y ≤ 27
x ≥ 0

 y ≥ 0
After simplification, we have:
4 x + 3 y ≤ 100

 x + 2 y ≤ 40
 x + y ≤ 27
x ≥ 0

 y ≥ 0

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

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

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

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

50. (a) The constraints are:

108 x + 72 y ≥ 2160

 x + y ≥ 25

0 ≤ x ≤ 24
0 ≤ y ≤ 24
After simplification, we have:
3 x + 2 y ≥ 60
From the graph, P attains its maximum at (14, 13). 
∴ The bakery should make 14 kg of cakes and  x + y ≥ 25

13 kg of cookies daily. 0 ≤ x ≤ 24
∴ The maximum profit = $[80(14) + 120(13)] 0 ≤ y ≤ 24
= $2680
(b)
49. (a) The constraints are:
150 x + 80 y ≤ 1000

4 x + y ≤ 20

 x + y ≤ 10
 x and y are non-negative integers.
After simplification, we have:
15 x + 8 y ≤ 100

4 x + y ≤ 20

 x + y ≤ 10
 x and y are non-negative integers.
(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
= $[100(10) + 80(15)]
= $2200

146
 4 Linear Programming

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:
 x + y ≤ 30

(20 − x) + (15 − y ) ≤ 15

0 ≤ x ≤ 20
0 ≤ y ≤ 15
After simplification, we have:
 x + y ≤ 30

 x + y ≥ 20 (c) Let $C be the cost, then C = 17 000 x + 48 000 y .

0 ≤ x ≤ 20
0 ≤ y ≤ 15

(b)

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

∴ 20 helicopters and 10 transport-troops should be
used.
(c) Cost of transporting coal to company A ∴ The minimum cost
= $[7 x + 3(20 − x)] = $[17 000(20) + 48 000(10)]
= $(4 x + 60) = $820 000
Cost of transporting coal to company B
= $[4 y + 2(15 − y )] (d) Since the route to the quake-stricken region might be
blocked, the best way to avoid delay would be to use
= $(2 y + 30)
helicopters.
Let $C be the total transportation cost, then Therefore, 50 helicopters and no transport-troops
C = (4 x + 60) + (2 y + 30) should be used.
= 4 x + 2 y + 90 The cost = $17 000 × 50 = $850 000
(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.
Choose (0, 0) as the test point.
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.
From the graph, C attains its minimum at (5, 15).
∴ The minimum transportation cost
= $[4(5) + 2(15) + 90]
= $140

52. (a) The constraints are:

10 x + 30 y ≥ 500 2. Answer: B
 ∵ The straight line passes through (−3, 0) and (0, 3).
3000 x + 8000 y ≥ 140 000 ∴ Equation of the straight line:
 x and y are non-negative integers.
 y −0 3−0
After simplification, we have: =
x − (−3) 0 − (−3)
 x + 3 y ≥ 50 y
 =1
3 x + 8 y ≥ 140 x+3
 x and y are non-negative integers.
 x− y+3= 0

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

Choose a point in the shaded region, say (−3, 3). 8. Answer: C

When x = −3 and y = 3, Since x and y are integers, the required possible pairs are
x − y + 3 = −3 − 3 + 3 = −3 ≤ 0 represented by the dots in the figure below.
∴ 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.
∴ There are 7 ordered pairs (x, y) which satisfy the
system of inequalities.
4. Answer: D
Choose (4, −2) as the test point.
9. Answer: C
When x = 4 and y = −2,
 L1 : x − 2 y + 12 = 0  (1)
2x + y = 2(4) + (−2) = 6 ≥ 0 
x − 2y − 4 = 4 − 2(−2) − 4 = 4 ≥ 0 L2 : y = − x + 9  (2)
∴ (4, −2) is one of the solutions of the system. By substituting (2) into (1), we have
∴ Region IV, which contains (4, −2), is the answer. x − 2(− x + 9) + 12 = 0
x + 2 x − 18 + 12 = 0
5. Answer: A 3x = 6
Since x ≤ 2, regions I and II may be the answer.
Equation of the line passing through (0, 4) and (4, 0): x=2
y−4 0−4 By substituting x = 2 into (2), we have
= y = −2 + 9
x−0 4−0
y − 4 = −x =7
∴ The intersection of L1 and L2 is (2, 7).
x+ y =4
By substituting x = 0 into (1), we have
Consider x + y ≥ 4. 0 − 2 y + 12 = 0
Use test point (1, 1), we have
x+y=1+1=2≱4 y=6
∴ Region I, that does not contain (1, 1), is the answer. ∴ L1 intersects the y-axis at (0, 6).
By substituting y = 0 into (2), we have
6. Answer: D 0 = −x + 9
∵ The shaded region is the common region of the lower
x=9
half-plane of y = 3, the upper half-plane of x + y = 0,
∴ L2 intersects the x-axis at (9, 0).
i.e. y = −x and the upper half-plane of x – y + 3 = 0,
Check the values of P = x + 2 y − 3 at the four vertices.
i.e. y = x + 3.
At (0, 0), P = 0 + 2(0) − 3 = −3
y ≤ 3
 At (0, 6), P = 0 + 2(6) − 3 = 9
∴ The system of the inequalities is  y ≥ − x ,
y ≥ x + 3 At (9, 0), P = 9 + 2(0) − 3 = 6

At (2, 7), P = 2 + 2(7) − 3 = 13
y ≤ 3 ∴ Maximum value of P = 13

i.e.  y ≥ − x .
 x − y ≤ −3
 10. Answer: A
Check the values of C = px + qy – 2 at the four vertices.
7. Answer: C At (−p, −q), C = p(−p) + q(−q) – 2 = − p2 − q2 − 2
∵ The shaded region is in the right half-plane of x = −3 . At (−q, p), C = p(−q) + q(p) – 2 = −2
∴ a ≥ −3 At (−p, q), C = p(−p) + q(q) – 2 = −p2 + q2 − 2
∴ I must be true. At (p, q), C = p(p) + q(q) – 2 = p2 + q2 − 2
∵ The shaded region is in the lower half-plane of ∵ p2 > 0 and q2 > 0
y = −2 x − 2 . ∴ − p2 − q2 − 2 is the minimum.
∴ b ≤ −2a − 2 ∴ C attains its minimum at (−p, −q).
2a + b + 2 ≤ 0
∴ II may not be true.
∵ The shaded region is in the upper half-plane of
1 32
x − 5 y = 32 , i.e. y = x − .
5 5
1 32
∴ b≥ a−
5 5
5b − a + 32 ≥ 0
∴ III must be true.
∴ The answer is C.

148
 4 Linear Programming

Exam Focus 2. (a) The shaded region is the common region of the left
half-plane of x = 7, the lower half-plane of
Exam-type Questions (p. 4.68) 4
4 x − 3 y = 0 , i.e. y = x and the upper half-plane of
3
1. (a) ∵ The x-intercept and the y-intercept of L1 are both
4 40
equal to 4. 4 x + 3 y − 40 = 0 , i.e. y = − x + .
∴ Equation of L1: 3 3
y−4 0−4 x ≤ 7
= 
x−0 4−0 ∴ The system of inequalities is 4 x − 3 y ≥ 0 .
y−4 4 x + 3 y − 40 ≥ 0
= −1 
x
y = −x + 4 (b) (i) The constraints are:
∵ L1 ⊥ L 2 20 x ≤ 140

−1 20 x ≥ 15 y
∴ Slope of L2 = 
slope of L1 20 x + 15 y ≥ 200
−1  x and y are non-negative integers.
=
−1 After simplification, we have:
=1 x ≤ 7
∵ L2 passes through (−2, −1). 
4 x − 3 y ≥ 0
∴ Equation of L2: 
4 x + 3 y − 40 ≥ 0
y − (−1)  x and y are non-negative integers.
=1
x − (−2)
Let the total cost be $C,
y +1 then C = 5000x + 4000y.
=1
x+2 −5000 5
y = x +1 Slope of 5000x + 4000y = 0 is , i.e. −
4000 4
4
(b) Choose a point in the shaded region, say (0, 0). Slope of 4 x + 3 y − 40 = 0 is −
3
∵ y = 0 ≥ −1
∵ Slope of 5000x + 4000y = 0 is less negative
∴ One inequality is y ≥ −1.
than that of 4 x + 3 y − 40 = 0 .
∵ −x + 4 = −(0) + 4 = 4
∴ 5000x + 4000y = 0 is less steeper than
y=0
4 x + 3 y − 40 = 0 .
∴ One inequality is y ≤ −x + 4.
∵ x+1=0+1=1 Therefore, refer to the graph given in (a),
C attains its minimum at point A.
y=0
∴ One inequality is y ≤ x + 1.
 y ≥ −1

∴ The system of inequalities is  y ≤ − x + 4 .
y ≤ x +1


 L1 : y = − x + 4  (1)

(c)  L2 : y = x + 1  (2)
 L : y = −1  (3) By substituting x = 7 into 4 x + 3 y − 40 = 0 ,
 3
By substituting (3) into (1), we have we have
−1 = − x + 4 4(7) + 3 y − 40 = 0
x=5 y=4
∴ One of the vertices is (5, −1). ∴ The coordinates of A are (7, 4).
(2) − (1): Minimum cost = $[5000(7) + 4000(4)] = $51 000,
0 = 2x − 3 which is already over $50 000.
Hence, the manager’s claim is correct.
x = 1.5
By substituting x = 1.5 into (1), we have (ii) The factory requires at least 200 units of the
y = −1.5 + 4 plastic, therefore,
= 2.5 200
supplier A has to provide at least = 10 boxes
∴ One of the vertices is (1.5, 2.5). 20
Check the values of P = x + 2y at the three vertices. of the plastic for the factory.
At (5, −1), P = 5 + 2(−1) = 3 The cost = $5000(10) = $50 000
At (−2, −1), P = −2 + 2(−1) = −4 ∴ The total cost will be decreased.
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.

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

3. Answer: C 7. Answer: C
a By substituting x = 0 into equation of L1, we have
The slope of ax + by = 0 is − .
b 0 − 2y + 6 = 0
∵ a, b > 0 y=3
∴ The slope of the line ax + by = 0 is negative, and the ∴ One of the vertices is (0, 3).
line slopes downwards. By substituting y = 0 into equation of L2, we have
Choose (0, 1) as the test point. 2x + 0 − 8 = 0
When x = 0 and y = 1, x=4
ax + by = a(0) + b(1) = b > 0
∴ One of the vertices is (4, 0).
∴ The half-plane containing the test point (0, 1)
represents the solutions of the inequality.  L1 : x − 2 y + 6 = 0  (1)

∴ The answer is C.  L2 : 2 x + y − 8 = 0  (2)
(1) × 2 − (2):
4. Answer: A
−4 y + 12 − ( y − 8) = 0
The shaded region is the common region of the lower half
plane of x + y = 2, i.e. y = 2 − x , the lower half-plane of − 5 y + 20 = 0
y = x and the upper half-plane of y = 0. y=4
 y ≤ −x − 2 By substituting y = 4 into (1), we have
 x − 2(4) + 6 = 0
∴ The system of inequalities is  y ≤ x ,
y ≥ 0 x=2
 ∴ One of the vertices is (2, 4).
x + y ≤ 2 Check the values of 3 x + 2 y − 4 at the four vertices.

i.e.  y ≤ x . At (0, 0), 3(0) + 2(0) − 4 = −4
y ≥ 0
 At (4, 0), 3(4) + 2(0) − 4 = 8
At (0, 3), 3(0) + 2(4) − 4 = 4
5. Answer: C At (2, 4), 3(2) + 2(4) − 4 = 10
−4 ≤ x ≤ 0 ∴ Maximum value = 10
∵ The shaded region of  is the common
− 5 ≤ y ≤ 0 Minimum value = −4
region of the right half-plane of x = −4, the left ∴ The answer is C.
half-plane of x = 0, the upper half-plane of y = −5 and
the lower half-plane of y = 0. Investigation Corner (p. 4.73)
∴ Regions II, IV and VI may be the solution.
1. The constraints are:
1
∵ x − 2 y ≥ 0 , i.e. y ≤ x 5 x + 10 y ≤ 800
2 
1 x ≤ y
∴ The lower half-plane of y = x , i.e. x − 2 y = 0 is  x and y are non-negative integers.
2 
the solution of the inequality x − 2 y ≥ 0 . After simplification, we have:
∴ Regions IV and VI represent the solution of  x + 2 y ≤ 160

x − 2 y ≥ 0 x ≤ y
  x and y are non-negative integers.
− 4 ≤ x ≤ 0 . 
− 5 ≤ y ≤ 0

2. Let the daily profit be $P, then P = 15x + 25y.
6. Answer: D
The point (x, y) lying outside R does not satisfy one of the
0 ≤ x ≤ 5

y ≥ 0
inequalities in the system  .
 x + 2 y ≤ 15
2 x − y ≤ 10
When x = 4 and y = 6,
x + 2 y = 4 + 2(6) = 16 > 15 ,
which does not satisfy the inequality x + 2 y ≤ 15 .
∴ (4, 6) lies outside R.

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.

150
 4 Linear Programming

3. (a) When D = 1,
the daily profit, P = 15x + (25 − 1)y
= 15x + 24y

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.

(b) Decrease in the maximum daily profit

= Original max. daily profit − new max. daily profit
= $[15(52) + 25(54)] − $[15(52) + 24(54)]
= $54

4. When D increases to 10, P becomes 15x + 15y. By

translating the line 15x + 15y = 0, we can check that
P attains its maximum at two points (52, 54) and (53, 53).
Further increasing the value of D, P will attain its
maximum at (53, 53) rather that (52, 54).
Hence, the required value is 10.

151