4 Linear Programming

4 Linear Programming Review Exercise 4 (p. 4.4)

1. (a)
Basic Knowledge Review x 0 3 4

Let’s Try (p. 4.3) y 6 0 2

1.
x 0 2 4
(b)
y 2 1 0

2. Draw the line y 4 x .

x 0 3 4
2.
y 4 1 0
Draw the line 3x  2 y  1 0 .
x 0 1 3

y 0.5 2 5

3.

ġ ɻġ The two straight lines intersect at (1.4, 2.6).

ġ ɺġġ The solution is x = 1.4 and y = 2.6.

4. Draw the line y 2x  3 .

x 2 3 4

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

x 1 3 5

y 3.5 4.5 5.5

1 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

Activity 4.2 (p. 4.26)

1. 0

2. (a)

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

ɺ The solution is x = 4 and y = 5.
(b) parallel
5. Draw the line x  y  2 0 . 3. (a) 1, 2, 3
x 4 2 0 1, 2, 3

y 2 0 2 (b) (i) increases

(ii) decreases
Draw the line x  3 y  4 0 .
4. 3, 3
x 4 1 2

y 0 1 2 To Learn More
To Learn More (p. 4.12)
Graphical representation of y ≤ ax + b:

Quick Practice
ɻ The two straight lines intersect at (2.5, 0.5). Quick Practice 4.1 (p. 4.10)
ɺ The solution is x = 2.5 and y = 0.5. (a) Draw the solid line x  2 y 4.

Activity x 0 2 4

Activity 4.1 (p. 4.7) y 2 1 0

1. Point (x, y) B(–2, 1) C(–1, 6) D(3, 4) When x = 0 and y = 0,

x  2 y 0  2(0) 0 d 4
Value of x + y –1 5 7
ġ ɺ The half-plane containing the test point (0, 0)
together with the boundary represents the solutions of
Point (x, y) E(2, –3) F(6, 0) the inequality.
Graphical representation of x + 2y ≤ 4:
Value of x + y –1 6

2. (a) C, D and F
(c) Yes, upper half-plane

3. (a) A, B and E
(c) Yes, lower half-plane

2 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

(b) Draw the solid line 3x  2 y 2. Quick Practice 4.3 (p. 4.11)
(a) Choose a point in the shaded region, say (2, 0).
x 0 2 4 When x 2 and y 0 ,
2 x  2 2(2)  2 2
y 1 2 5
y 0
When x = 0 and y = 0,
ɺ y ! 2 x  2
3x  2 y 3(0)  2(0) 0 d 2
ɺ The required inequality is y ! 2 x  2 .
ɺ The half-plane containing the test point (0, 0)
together with the boundary represents the solutions of
the inequality. (b) Choose a point in the shaded region, say (2, 4).
Graphical representation of 3x  2y ≤ 2: When x = 2 and y = –4,
2 x  5 y 2(2)  5(4) 24 t 10
ɺ The required inequality is 2 x  5 y t 10 .

Quick Practice 4.4 (p. 4.17)

­3x  y  1
Graphical representation of ® :
¯x d 2 y  2

Quick Practice 4.2 (p. 4.11)

(a) Draw the dotted line x  2 y 2.
x 0 2 4
y 1 0 1
When x = 0 and y = 0,
x  2y = 0  2(0) = 0 < 2
Quick Practice 4.5 (p. 4.19)
ɺ The half-plane containing the test point (0, 0)
represents the solutions of the inequality. ­y  2
°
Graphical representation of x  2y < 2: (a) Graphical representation of ® x  y d 4 :
°2 x  y t 3
¯

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

(b) Draw the dotted line 3x  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
ɺ The half-plane not containing the test point (0, 0)
represents the solutions of the inequality. ɺ There are 10 pairs of x and y which satisfy the system
Graphical representation of 3x + 4y > 12: of inequalities in (a).

3 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

Quick Practice 4.6 (p. 4.20) Alternative Solution

(a) ɻ The shaded region is on the right of the line x 0. Check the values of P = 3x  y at the three vertices.
ɺ One inequality is x t 0 . At (3, 4), P 3(3)  (4) 5
ɻ The shaded region is below the line y 4. At (–5, 4), P 3(5)  (4) 19
ɺ One inequality is y  4 . At (–1, –4), P 3(1)  (4) 1
Choose a point in the shaded region, say (0, 0). ɺ The maximum value of P is 5, and the minimum
When x 0 and y 0 , value of P is –19.
x  2 = 0  2 = 2 Quick Practice 4.8 (p. 4.31)
y=0 (a)
ɺ The remaining inequality is y t x  2 .
­y t x  2
°
Hence, the required system of inequalities is ® y  4 .
°x t 0
¯

(b) ɻ The shaded region is above the line y 0.

ɺ One inequality is y t 0 .
Choose a point in the shaded region, say (6, 1).
When x 6 and y 1 ,
x + 2y = 6 + 2(1) = 8 ≤ 10
ɺ One inequality is x  2 y d 10 .
2x  y = 2(6)  1 = 11 ≥ 10
ɺ The remaining inequality is 2 x  y t 10 . (b)
Hence, the required system of inequalities is
­y t 0
°
® x  2 y d 10 .
°2 x  y t 10
¯

Quick Practice 4.7 (p. 4.30)

(a)

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

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

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

ɺ 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

4 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

Quick Practice 4.9 (p. 4.33) (c) Let $P be the profit, then P 240x  200 y .
(a)

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.5, –3.5).
ɺ Minimum value of P 4(3.5)  2(3.5)  1 20
From the graph, P attains its maximum at (5, 7.5).
ɺ Maximum value of P 240(5)  200(7.5) 2700
(b) Since x and y are integers, the feasible solutions are ɺ The candy shop should produce 5 kg of dark
represented by the dots in the figure below. chocolate and 7.5 kg of white chocolate each day to
attain a maximum profit of $2700.

Quick Practice 4.11 (p. 4.44)

­ xd y
° x  y t 60
°
(a) The constraints are: ®
° xt0
°¯ y t 0

(b)

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

Quick Practice 4.10 (p. 4.42)

­ x  2 y d 20
° 6 x  4 y d 60
°
(a) The constraints are: ®
° xt0
°¯ y t 0
(c) Let $C be the cost, then C 15x  20 y .
­ x  2 y d 20
° 3 x  2 y d 30
°
After simplification, we have ® .
° xt0
°¯ y t 0

(b)

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.

5 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

Quick Practice 4.12 (p. 4.46) After simplification, we have:

­10 x  15 y t 30 ­x d 6
°30 x  30 y t 90 ° y d 11
°° °°
(a) The constraints are: ®40 x  20 y t 100 ® x  y t 10
°x t 0 ° x  y d 15
° °
°¯ y t 0 °̄ x and y are non-negative integers.
­2 x  3 y t 6
°x  y t 3 (b)
°°
After simplification, we have ®2 x  y t 5 .
°x t 0
°
°¯ y t 0

(b)

(c) Let $C be the total cost on hiring workers per day.

C 600 x  400 y  1000(10  x)  600(15  y)
19 000  400 x  200 y

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

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

From the graph, C attains its minimum at (2, 1). ɺ The minimum total cost on hiring workers per day
ġ ɺ Minimum value of C = 15(2) + 10(1) = 40 $[19 000  400(6)  200(9)]
ġ ɺ A can of cat food should contain 200 g of foodstuff A $14 800
and 100 g of foodstuff B to attain a minimum cost of
<$15 000
$40.
ɺġ The claim is disagreed.
Quick Practice 4.13 (p. 4.48)
(a) ɻ There are x full-time workers working in the daytime. Further Practice
ɺ There are (10 – x) full-time workers working in
Further Practice (p. 4.20)
overnight sessions.
ɻ There are y part-time workers working in the ­x  y d 6
°
daytime. 1. (a) Graphical representation of ® y ! 2 x :
ɺ There are (15 – y) part-time workers working in °y  x  4
¯
overnight sessions.
The constraints are:
­10  x t 4
°15  y t 4
°
°x  y 1
° t
® 30 3
° (10  x)  (15  y ) 1
° t
° 30 3
° x and y are non-negative integers.
¯

6 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

(b) Since x and y are positive integers, the required The remaining vertex is (3, 2).
possible pairs are represented by the dots in the figure Check the values of P = 4x + 3y at the three vertices.
below. 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)

ɺ 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 t 0 .
ɻ The shaded region is below the line y 0. (b)
ɺ One inequality is y d 0 .
Choose a point in the shaded region, say (3, 0).
When x 3 and y 0 ,
x  2 y 3  2(0) 3 t 2
ɺ One inequality is x  2 y t 2 .
Choose a point in the shaded region, say (3, 0).
When x 3 and y 0 ,
3x  2 y 3(3)  2(0) 9  12
(i) From the graph, P attains its maximum at (4, 0.5).
ɺ The remaining inequality is 3x  2 y  12 . ɺġ Maximum value of P 2(4)  (0.5)  0.5 8
Hence, the required system of inequalities is
From the graph, P attains its minimum at (0, 0.5).
­x  2 y t 2 ɺġ Minimum value of P 2(0)  (0.5)  0.5 0
°3x  2 y  12
°
® .
°x t 0 (ii) Since x and y are integers, the feasible solutions
°¯ y d 0 are represented by the dots in the figure below.

Further Practice (p. 4.34)

1. (a) ɻ The shaded region is on the left of the line
x 3.
ɺ One inequality is x d 3 .
ɻ The shaded region is above the line y 2 .
ɺ One inequality is y t 2 .
Choose a point in the shaded region, say (0, 0).
When x 0 and y 0 , From the graph, P attains its maximum at (3, 0).
7 x  6 y 7(0)  6(0) 0 t 9 ɺ Maximum value of P = 2(3) + 0 + 0.5 = 6.5
ɺ The remaining inequality is 7 x  6 y t 9 . From the graph, P attains its minimum at (0, 0).
Hence, the required system of inequalities is ɺ Minimum value of P = 2(0) + 0 + 0.5 = 0.5
­x d 3
°
® y t 2 . Exercise
°7 x  6 y t 9
¯ Exercise 4A (p. 4.13)
Level 1
(b) By substituting x = 3 into the equation of L3, 1. (a)
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:
7 x  6(2) 9
x 3
ɺ One of the vertices is (3, 2).

7 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

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

When x = 2 and y = 2,
3x = 3(2) = 6
2y = 2(2) = 4 < 6
ġ ġ ɺ The half-plane containing the test point (2, 2)
represents the solutions of the inequality.
Graphical representation of 2y < 3x:

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

When x = 0 and y = 0,
x  2 0  2 2 ‫ خ‬0
ġ ġ ɺ The half-plane not containing the test point
(0, 0) represents the solutions of the inequality.
Graphical representation of y ≤ x  2:

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

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

When x = 0 and y = 0,
2x  4 2(0)  4 4 ൐ 0
ġ ġ ɺ The half-plane containing the test point (0, 0)
represents the solutions of the inequality.
Graphical representation of y ≤ 2x + 4:
(b) Choose (0, 0) as the test point.
When x = 0 and y = 0,
3x + 2y = 3(0) + 2(0) = 0 ‫ خ‬5
ġ ġ ɺ The half-plane not containing the test point
(0, 0) represents the solutions of the inequality.
Graphical representation of 3x + 2y ≥ 5:

3. (a) 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: 5. (a) 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 not containing the test point
(0, 0) represents the solutions of the inequality.
Graphical representation of 2x + y  3 > 0:

8 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

(b) Choose (0, 0) as the test point. 9. Draw the solid line 2x  y 4 .
When x = 0 and y = 0, Choose (0, 0) as the test point.
4x  3y  12 = 4(0)  3(0)  12 = 12 ൏ 0 When x = 0 and y = 0,
ġ ġ ɺ The half-plane containing the test point (0, 0) 2x  y = 2(0)  0 = 0 ≤ 4
represents the solutions of the inequality. ġ ɺ The half-plane containing the test point (0, 0)
Graphical representation of 4x  3y  12 < 0: together with the boundary represents the solutions of
the inequality.

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

Choose (0, 0) as the test point. 10. Draw the dotted line x + y = 6.
When x = 0 and y = 0, Choose (0, 0) as the test point.
x  3 = 0  3 = 3 ≤ 0 When x = 0 and y = 0,
ġ ɺ The half-plane containing the test point (0, 0) x+y=0+0=0൏6
together with the boundary represents the solutions of ġ ɺ The half-plane containing the test point (0, 0)
the inequality. represents the solutions of the inequality.

7. Draw the dotted line y = 3x + 2. 11. Draw the solid line x  3 y  3 0 .

Choose (0, 0) as the test point. Choose (0, 0) as the test point.
When x = 0 and y = 0, When x = 0 and y = 0,
3x + 2 = 3(0) + 2 = 2 > 0 x  3y  3 = 0  3(0)  3 = 3 ‫Ͳخ‬
ġ ɺ The half-plane containing the test point (0, 0) ġ ɺ The half-plane not containing the test point (0, 0)
represents the solutions of the inequality. together with the boundary represents the solutions of
the inequality.

8. Draw the dotted line x = 2y.

Choose (1, 2) as the test point.
When x = 1 and y = 2, Level 2
2y = 2(2) = 4 ‫ ث‬1 12. Choose a point in the shaded region, say (0, 0).
ġ ɺ The half-plane not containing the test point (1, 2) When x 0 and y 0 ,
represents the solutions of the inequality. 3x  3 3(0)  3 3
y 0
ɺ y t 3x  3
ɺ The required inequality is y t 3x  3 .

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

When x 2 and y 0 ,
2x  y 2(2)  0 4  1
ɺ The required inequality is 2x  y  1 .

9 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

14. Choose a point in the shaded region, say (1, 0). 3x  2 y y  2 x

When x 1 and y 0 , 19. t
4 3
4x  3 y 4(1)  3(0) 4 ! 0 3(3 x  2 y ) d 4( y  2 x)
ɺ The required inequality is 4 x  3 y ! 0 . 9 x  6 y d 4 y  8 x
2y d x
15. Choose a point in the shaded region, say (0, 0).
Draw the solid line 2y = x.
When x 0 and y 0 , Choose (1, 1) as the test point.
2x  4 y  3 2(0)  4(0)  3 3 d 0 When x = 1 and y = 1,
ɺ The required inequality is 2x  4 y  3 d 0 . 2y = 2(1) = 2
x=1‫خ‬2
16. 3x  1 d y  2 ɺ The half-plane not containing the test point (1, 1)
represents the solutions of the inequality.
3x  y d 3
Draw the solid line 3x – y = 3.
Choose (0, 0) as the test point.
When x = 0 and y = 0,
3x  y = 3(0)  0 = 0 ‫ ح‬3
ɺ The half-plane not containing the test point (0, 0)
represents the solutions of the inequality.

20. (a) Choose a point in the shaded region, say (0, 0).
2 y  4x 2(0)  4(0) 0 d 3
ɺ The inequality is 2y – 4x d 3.

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

17. 2 x  3 y ! 3x  y value of y satisfying the inequality is 5.
5x  4 y  0 ɺ The maximum value of b is 5.
Draw the dotted line 5x – 4y = 0.
Choose (2, 1) as the test point. 21. (a) Choose (0, 0) as the test point.
When x = 2 and y = 1, When x = 0 and y = 0,
5x  4y = 5(2)  4(1) = 6 ‫ ث‬0 2x  2 = 2(0)  2 = 2 < 0
ɺ The half-plane not containing the test point (2, 1) ɺ The half-plane containing the test point (0, 0)
represents the solutions of the inequality. represents the solutions of the inequality.

18. 2( x  y )  3( x  1)
(b) From the graph, when y = 2, the minimum integral
2 x  2 y  3x  3 value of x satisfying the inequality is 1.
x  2y ! 3 ɺ The minimum value of h is 1.
Draw the dotted line x – 2y = 3.
Choose (0, 0) as the test point. 22. (a) By substituting x = 4 and y = 0 into y 3x  b ,
When x = 0 and y = 0, we have
x – 2y = 0 – 2(0) = 0 ‫ج‬3 0 3(4)  b
ɺ The half-plane not containing the test point (0, 0)
represents the solutions of the inequality. b 12

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

When x 0 and y 0 ,
3x  12 3(0)  12 12
y 0
ɺ y ! 3x  12
ɺ The required inequality is y ! 3x  12 .

10 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

(c) When x 1 and y 10 , 2. (a) (i) Choose (0, 0) as the test point.
3x  12 3(1)  12 9 When x = 0 and y = 0,
x + y = 0 + 0 = 0 ‫ج‬4
y 10 ɺ The half plane not containing the test point
ɻ y  3x  12 (0, 0) represents the solutions of the
ɺ The ordered pair (1, –10) is not a solution of the q y
inequality.
inequality y ! 3x  12 .

Exercise 4B (p. 4.21)

Level 1
1. (a) (i) Choose (0, 1) as the test point.
When y = 1,
y=1≥0
ɺ The half plane containing the test point
(0, 1) represents the solutions of the
inequality.

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

When x = 0 and y = 0,
x + 2y = 0 + 2(0) = 0 ≤ 4
ɺ The half plane containing the test point
(0, 0) represents the solutions of the
inequality.

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

When x = 0 and y = 0,
3x + y = 3(0) + 0 = 0 ≤ 6
ɺ The half plane containing the test point
(0, 0) represents the solutions of the
q y
inequality.

(b)

(b)

3. (a)

11 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

(b) (b) 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 t 1
°
ɺ The system of inequalities is ® x  y  4 .
°x  3y t 4
4. (a) ¯

7. The solutions of 3 d y  1 are represented by the shaded

region in the figure below.

(b)

5. (a) Choose a point in the shaded region, say (2, 2). ­2 x t 4

ɻ 2x  3 2(2)  3 1 8. ®
¯3 y d 9
y 2
­x t 2
ġ ġ ɺ One inequality is y ≤ 2x  3. ®
¯y d 3
ɻ y 2 t 3
­2 x t 4
ɺ One inequality is y ≥ 3. The solutions of ® are represented by the shaded
­ y d 2 x  3 ¯3 y d 9
ɺ The system of inequalities is ® . region in the figure below.
¯ y t 3

(b) 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.
­y  x  2
ɺ The system of inequalities is ® .
¯y ! x

6. (a) 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 d 2
ɺ The system of inequalities is ® .
¯x  2 y t 1

12 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

­x d 1 (b)
9. The solutions of ® are represented by the shaded
¯ y d 3x  1
region in the figure below.

14. (a)

­y ! 2
10. The solutions of ® are represented by the
¯4 x  3 y  12
shaded region in the figure below.

(b)

­x  y  1 ! 0
11. The solutions of ® are represented by the
¯2 y  x  3 t 0
shaded region in the figure below.

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

ɻ 2x + 3y = 2(1) + 3(1) = 5 ≤ 6
ġ ɺ One inequality is 2x + 3y ≤ 6.
ɻ x+y1=1+11=1≥0
ɺ One inequality is x + y  1 ≥ 0.
ɻ x=1≥0
­2 x  y t 0 ɺ One inequality is x ≥ 0.
12. The solutions of ® are represented by the
¯3x  y  9 d 0 ­2 x  3 y d 6
°
shaded region in the figure below. ɺ The system of inequalities is ® x  y  1 t 0 .
°x t 0
¯

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
Level 2
ɺ One inequality is 4x  y ≥ 12.
13. (a)
ɻ y = 2 ≤ 0
ɺ One inequality is y ≤ 0.
­ y d 2 x  18
°x  3y ! 6
°
ɺ The system of inequalities is ® .
°4 x  y t 12
°¯ y d 0

13 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

­x  y d 7 ­2 x  y  2
° °
17. The solutions of ® y ! 3 x are represented by the shaded 21. (a) The solutions of ® x t 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 d 1 are represented by the dots in the figure below.
°
18. The solutions of ® x  2 y d 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).

­3 x  4 y  3 ! 0
°
22. (a) The solutions of ®3 x  4 y  12 t 0 are represented by
­y  x °x d 3
° ¯
19. The solutions of ® x  2 y d 6 are represented by the
°2 x  y t 2 the shaded region in the figure below.
¯
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.
­2 x  3 y  6 ! 0
°
20. The solutions of ®2 x  y ! 8 are represented by the
°y  x  6 d 0
¯
shaded region in the figure below.

ġ ġ ɺ There are 12 pairs of x and y which satisfy the

­3 x  4 y  3 ! 0
°
system of inequalities ®3 x  4 y  12 t 0 .
°x d 3
¯

14 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

­3 x  2 y  4 t 0 5.
°
23. (a) The solutions of ®5 x  y  28  0 are represented by
°2 x  3 y  19 t 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
the inequality 5x + y – 28 < 0.

Exercise 4C (p. 4.34)

Level 1
1. Check the values of P = 2x + y at the four vertices.
From the graph, P attains its maximum at (–4, 3).
At (3, 3), P = 2(3) + (3) = 9
ɺ Maximum value of P = –4(–4) + 2(3) = 22
At (–2, 3), P = 2(–2) + (3) = 1
At (–2, –1), P = 2(–2) + (–1) = –5 From the graph, P attains its minimum at (4, –1).
At (3, –1), P = 2(3) + (–1) = 5 ɺ Minimum value of P = –4(4) + 2(–1) = 18
(a) P attains its maximum at (3, 3), and the corresponding
maximum value of P is 9.
7. (a) Choose a point in the shaded region, say (0, 0).
(b) P attains its minimum at (–2, –1), and the
ɻ x  y  2 = 0  0  2 = 2 ≤ 0
corresponding minimum value of P is –5.
ġ ġ ɺ One inequality is x  y  2 ≤ 0.
2. Check the values of P = –2x + y at the three vertices. ɻ x = 0 ≥ 2
At (0, 4), P = –2(0) + (4) = 4 ɺ One inequality is x ≥ 2.
At (0, 0), P = –2(0) + (0) = 0 ɻ y=0≤3
At (6, 0), P = –2(6) + (0) = –12 ɺ One inequality is y ≤ 3.
(a) P attains its maximum at (0, 4), and the
corresponding maximum value of P is 4. ­x  y  2 d 0
°
(b) P attains its minimum at (6, 0), and the corresponding ɺ The system of inequalities is ® x t 2 .
minimum value of P is –12. °y d 3
¯
3. Check the values of P = x + 3y at the three vertices.
At (1, 2.5), P = 1 + 3(2.5) = 8.5 (b) (i) Check the values of P = 3x  y at the three
At (–1.5, 1), P = –1.5 + 3(1) = 1.5 vertices.
At (3, 0), P = 3 + 3(0) = 3 At (5, 3), P = 3(5)  3 = 
(a) P attains its maximum at (1, 2.5), and the At (–2, 3), P = 3(–2)  3 = –9
corresponding maximum value of P is 8.5. At (–2, –4), P = 3(–2)  (4) = –2
(b) P attains its minimum at (–1.5, 1), and the ɺ Maximum value of P = 12
corresponding minimum value of P is 1.5.
Minimum value of P = 9
4. Check the values of P = –x – 3y at the four vertices.
At (1.5, 1), P = –1.5 – 3(1) = –4.5 (ii) Check the values of P = 2x  5y at the three
At (–1.5, –1), P = –(–1.5) – 3(–1) = 4.5 vertices.
At (–0.5, –2), P = –(–0.5) – 3(–2) = 6.5 At (5, 3), P = 2(5)  5(3) = 25
At (2, –2), P = –2 – 3(–2) = 4 At (–2, 3), P = 2(–2)  5(3) = –11
(a) P attains its maximum at (–0.5, –2), and the At (–2, –4), P = 2(–2)  5(4) = 24
corresponding maximum value of P is 6.5. ġ ġ ġ ɺ Maximum value of P = 24
(b) P attains its minimum at (1.5, 1), and the
corresponding minimum value of P is –4.5. Minimum value of P = 25

15 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

8. (a) Choose a point in the shaded region, say (1, 2). ­x t 0

ɻ 7x + y = 7(1) + 2 = 9 ≥ 5 °
9. (a) The solutions of ® y t 4 are represented
ġ ġ ɺ One inequality is 7x + y ≥ 5. °5 x  4 y  20 d 0
ɻ 7x + 4y = 7(1) + 4(2) = 15 ≤ 34 ¯
ɺ One inequality is 7x + 4y ≤ 34. by the shaded region in the figure below.
3
ɻ y = 2 ≥ and y = 2 ≤ 5
2
3
ɺ One inequality is d y d 5 .
2
­7 x  y t 5
ɺ The system of inequalities is °°7 x  4 y d 34 .
®
°3 d y d 5
°̄ 2

(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

­1 d x d 2
°
10. (a) The solutions of ® y d 9 are represented by the
°x  y t 6
¯
ɺ There are 11 pairs of (x, y) which satisfy the shaded region in the figure below.
system of inequalities in (a).

(c) (i)

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

From the graph, P attains its maximum at (2, 5). At (1, 7), P = 4(1) + 7 + 2 = 5
ġ ġ ġ ɺ Maximum value of P = 13 At (1, 9), P = 4(1) + 9 + 2 = 7
From the graph, P attains its minimum at (1, 2). At (2, 9), P = 4(2) + 9 + 2 = 19
ɺ Minimum value of P = 6 At (2, 4), P = 4(2) + 4 + 2 = 14
ɺ Maximum value of P = 19
(ii)
Minimum value of P = 5

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

ġ ġ ġ ɺ Maximum value of P = 15
From the graph, P attains its minimum at (3, 2).
ɺ Minimum value of P = 6

16 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

­1 d x d 2 13. (a) From the graph, 2 d x d 0 and y t 2 .

° ɺġ a 2, b 0, c 2 ġ
11. (a) The solutions of ® y d 2 are represented by the
°x  2 y t 3 From the graph, (0, 6) lies on the straight line
¯ ġ ġ
shaded region in the figure below. 2x + y = d.
By substituting (0, 6) into 2x + y = d, we have
2(0)  6 d
d 6
ġ
ġ (b) Check the values of P = x + y at the four vertices.
At (–2, 10), P = –2 + 10 = 
At (–2, 2), P = –2 + 2 = 
  At (0, 2), P = 0 + 2 = 
  At (0, 6), P = 0 + 6 = 
ɺ Minimum value of P = 0
ɻġ 0 is neither positive nor negative.
(b) Check the values of P = 2x – 6y at the four vertices. ɺġ The claim is disagreed.
At (1, 1), P = 2(1) – 6(1) = 8
At (1, 2), P = 2(1) – 6(2) = 14 Level 2
At (2, 2), P = 2(2) – 6(2) = 16 ­x  2 y  4 t 0
At (2, 0.5), P = 2(2) – 6(0.5) = 7 °x  2 y  6 d 0
°
ɺ Maximum value of P = 7 14. The solutions of ® are represented by the
°x t 0
Minimum value of P = 16 °¯ y t 0
shaded region in the figure below.
12. (a)

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

At (0, 0), P 00 0
At (6, 0), P 60 6
At (1, 2.5), P 1  2.5 1.5
At (0, 2), P 0  2 2
(b) Choose a point in the shaded region, say (1, 2).
ɻ x + 2y = 1 + 2(2) = 5 ≤ 12 ɺ! Maximum value of P = 6
ġ ġ ɺ One inequality is x + 2y ≤ 12. Minimum value of P = 2
ɻ x=1
y=2≥1
­2 x  y  6 d 0
ɺ One inequality is x ≤ y. °3x  4 y  20 d 0
ɻ x=1≥0 °
15. The solutions of ® are represented by the
ɺ One inequality is x ≥ 0. °x t 0
°¯ y t 0
­x t 0
° shaded region in the figure below.
ɺ The system of inequalities is ® x d y .
° x  2 y d 12
¯

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

At (0, 0), P = 0 + 3(0) = 
At (4, 4), P = 4 + 3(4) = 
  At (0, 6), P = 0 + 3(6) = 
ɺ Maximum value of P = 18 > 17
ɺġ The claim is disagreed.

17 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

Check the values of P 2x  y at the four vertices. ­4 x  y t 4

°
At (0, 0), P 2(0)  0 0 18. The solutions of ®3x  2 y  3 d 0 are represented by the
At (0, 5), P 2(0)  5 5 °2 x  3 y t 8
¯
At (4, 2), P 2(4)  2 10 shaded region in the figure below.
At (3, 0), P 2(3)  0 6
ɺ! Maximum value of P = 10
Minimum value of P = 0

­x  y d 4
°2 x  y d 6
°
16. The solutions of ® are represented by the
°x t 0
°¯ y t 0
shaded region in the figure below. Check the values of P x  y  3 at the three vertices.
At (1, 0), P 1  0  3 2
At (2, 4), P 2 43 3
At (5, ), P 5  6  3 8
ɺ! Maximum value of P = 8
Minimum value of P = 2

­2 x  y t 1
°
19. The solutions of ®3 x  y t 9 are represented by the
Check the values of P 4x  3 y  5 at the four vertices. °7 x  y d 21
¯
At (0, 0), P 4(0)  3(0)  5 5 shaded region in the figure below.
At (0, 4), P 4(0)  3(4)  5 7
At (2, 2), P 4(2)  3(2)  5 9
At (3, 0), P 4(3)  3(0)  5 7
ɺ! Maximum value of P = 5
Minimum value of P = 9

­x  y t 0
°
17. The solutions of ® x  y t 2 are represented by the
°3 x  y d 12
¯
shaded region in the figure below.
Check the values of P 2x  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

20. (a) Check the values of P = 1  x  2y at the three

Check the values of P x  2 y at the three vertices. vertices.
At (1, 2), P 1  1  2(2) 4
At (1, 1), P 1  2(1) 3
At (3.5, 0.5), P 1  3.5  2(0.5) 1.5
At (3, 3), P 3  2(3) 9
At (3.5, 4.5), P 1  3.5  2(4.5) 11.5
At (5, 3), P 5  2(3) 1
ɺ Maximum value of P 1.5
ɺ! Maximum value of P = 9
Minimum value of P 11.5
Minimum value of P = 1

18 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

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

are the points indicated by the dots in the figure. °
22. (a) The solutions of ® y d 2 x  2 are represented by
°4 y d 14 x  41
¯
the shaded region in the figure below.

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

ġ ġ ɺ Maximum value of P 1  3  2(0) 2
From the graph, P attains its minimum at (3, 4).
ɺ Minimum value of P 1  3  2(4) 10
(b) (i) Check the values of P 3x  2 y  6 at the three
vertices.
­y 1t 0
° At (2, 2 , P 3(2)  2(2)  6 16
21. (a) The solutions of ® x  y  1 t 0 are represented by the
°x  y d 4 At (1.5, 5), P 3(1.5)  2(5)  6 8.5
¯ At (3.5, 2), P 3(3.5)  2(2)  6 0.5
shaded region in the figure below.
ɺ Maximum value of P 8.5
Minimum value of P 16
(ii) Since x and y are integers, the feasible solutions
are the points indicated by the dots in the figure.

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

vertices.
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
From the graph, P attains its maximum at (2, 3).
ɺ Maximum value of P = 9 ɺ Maximum value of P 3(2)  2(3)  6
ɺ Minimum value of P = 5 6
(ii) Since x and y are integers, the feasible solutions From the graph, P attains its minimum at (–2, –2).
are the points indicated by the dots in the figure. ɺ Minimum value of P 3(2)  2(2)  6
16

23. (a) The shaded region is the common region of the left
half-plane of L1, the lower half-plane of L2, the upper
half-plane of L3 and the upper half-plane of L4.
­x d 9
°y d 8
°°
ɺ The system of inequalities is ® 1 .
°y t 3 x
°
From the graph, P attains its maximum at (2, 2). °̄ y t 7 x  22
ɺ Maximum value of P 2  3(2) 8
From the graph, P attains its minimum at (–2, –1).
ɺ Minimum value of P 2  3(1) 5

19 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

(b) Coordinates of A (9, 8) (b) The shaded region is the common region of the lower
half-plane of L1, the lower half-plane of L2 and the
­ L2 : y 8 (1) upper half-plane of L3.
®
¯ L4 : y 7 x  22 (2) ­ y d x  6
°
By substituting (1) into (2), we have ɺ The system of inequalities is ® y d x  2 .
8 7 x  22 °y t1
¯
x 2
ɺ Coordinates of B (2, 8) (c) By substituting y = 1 into the equation of L1, we have
1 x  6
­ L4 : y 7 x  22 (2)
° x 5
® 1
° L3 : y 3 x (3) ɺ The intersection of L1 and L3 is (5, 1).
¯ By substituting y = 1 into the equation of L2, we have
From (3), we have 1 x2
x = 3y ……(4)
x 1
By substituting (4) into (2), we have
y 7(3 y )  22 ɺ The intersection of L2 and L3 is (1, 1).
Check the values of P = 3x + 4y at the three vertices.
22 y 22
At (2, 4), P 3(2)  4(4) 10
y 1
At (1, 1), P 3(1)  4(1) 7
By substituting y = 1 into (4), we have
x 3(1) 3 At (5, 1), P 3(5)  4(1) 11
ɺ Coordinates of C (3, 1) ɺ Maximum value of P 10
Minimum value of P 11
­ 1
° L3 : y x (3)
® 3
°L : x 9 25. (a) By substituting R(5, 0) into L1: mx  y = 10, we have
¯ 1 (5)
m(5)  0 10
By substituting (5) into (3), we have
m 2
1
y (9) 3 By substituting P(0, 8) into L2: 2x + ny = 40, we have
3
2(0)  n(8) 40
ɺ Coordinates of D (9, 3)
n 5

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

respectively. ­2 x  y 10 ......(1)
(b) ®
At A(9, 8), P 2(9)  8 26 ¯2 x  5 y 40 ......(2)
At B(2, 8), P 2(2)  8 12 From (1), we have y 2 x  10 ......(3)
At C(3, 1), P 2(3)  1 7 By substituting (3) into (2), we have
At D(9, 3), P 2(9)  3 21 2 x  5(2 x  10) 40
ɺ Maximum value of P 26 2 x  10 x  50 40
12 x 90
Minimum value of P 7
x 7.5
By substituting x = 7.5 into (3), we have
24. (a) The equation of L2: y 2(7.5)  10
y4
1 5
x2 ɺ The coordinates of Q are (7.5, 5).
y4 x2
y x2 (c) Choose a point in the region OPQR, say (1, 1).
ɻ L1 A L2 ɻ x=1≥0
Slope of L1 u slope of L2 1 ɺ One inequality is x ≥ 0.
ɺ
ɻ y=1≥0
Slope of L1 u 1 1
ɺ One inequality is y ≥ 0.
Slope of L1 1 ɻ 2x + 5y = 2(1) + 5(1) = 7 ≤ 40
The equation of L1: ɺ One inequality is 2x + 5y ≤ 40.
y4 ɻ 2x  y = 2(1)  1 = 1 ≤ 10
1
x2 ɺ One inequality is 2x  y ≤ 10.
y  4 x  2 ­x t 0
y x  6 °y t 0
°
ɺ The system of inequalities is ® .
°2 x  5 y d 40
°¯2 x  y d 10

20 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

(d) Let P = 2x + 3y. ­3x  y 18 ......(1)

Check the values of P at the four vertices of the region (b) (i) ®
OPQR. ¯y 2 ......(2)
At (0, 0), P = 2(0) + 3(0) = 0 By substituting (2) into (1), we have
At (0, 8), P = 2(0) + 3(8) = 24 3 x  2 18
At (5, 0), P = 2(5) + 3(0) = 10
At (7.5, 5), P = 2(7.5) + 3(5) = 30 16
x
ɺ Maximum value of P = 30 3
ɺġ 2h + 3k ≤ 30 Check the values of P = 4x + 3y at the four
vertices.
26. (a) The equations of the two horizontal lines are y = 0 At (1, 2), P = 4(1) + 3(2) = 10
and y = 6.
§ 16 · § 16 · 82
Since the remaining line is parallel to 2x  y = 10, At ¨ , 2 ¸ , P 4 ¨ ¸  3(2) | 27.3
let 2x  y = c be the equation of the remaining line. ©3 ¹ ©3¹ 3
By substituting y = 0 into 2x – y = 10, we have At (1, 11), P = 4(1) + 3(11) = 37
2 x  0 10 At (3, 9), P = 4(3) + 3(9) = 39
x 5 ɺ Maximum value of P 39
ɺ The x-intercept of 2x – y = 10 is 5.
ɺ The x-intercept of 2x – y = c is 2. (ii) (1) ɻġ The maximum value of P is given by
By substituting (2, 0) into 2x – y = c, we have an integral pair of x and y.
2(2)  0 c ɺġ The maximum value of P remains
c 4 unchanged.
ɺġ The equation of the remaining line is 2x  y = 4. ­ x  y d 12
°
(2) The solutions of ® x t 1 are
(b) Choose a point in the shaded region, say (4, 2). °y t 2
ɻġ y = 2 and 0 ≤ 2 ≤ 6 ¯
ɺġ One pair of inequalities is 0 ≤ y ≤ 6. represented by the shaded region in the
ɻġ 2x  y = 2(4)  2 = 6 and 4 ≤ 6 ≤ 10 figure below.
ɺġ The remaining inequalities are 4 ≤ 2x  y ≤ 10.
­0 d y d 6
ɺġ The system of inequalities is ® .
¯4 d 2 x  y d 10

(c) Check the values of P = 3x + y at the four vertices.

At (2, 0), P = 3(2) + 0 = 6
At (5, 0), P = 3(5) + 0 = 15
At (5, 6), P = 3(5) + 6 = 9
At (8, 6), P = 3(8) + 6 = 18
ɺ Maximum value of P = 6 < 0
ɺġ It is true that the value of P is negative for any
point (x, y) lying in R.
Check the value of P = 4x + 3y at the new
­ x  y d 12 vertex (10, 2).
°3 x  y d 18 P = 4(10) + 3(2) = 46 > 39
°
27. (a) The solutions of ® are represented by
ɺġ The new maximum value of P = 46
°x t 1
°¯ y t 2 The change in the maximum value of P
the shaded region in the figure below. = 46  39
7

Exercise 4D (p. 4.49)

Level 1
­ x  y t 30
°x ! y
°
1. The constraints are: ®
°x t 0
°¯ y t 0

21 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

­4 x  6 y d 150 (c) (i) P 500 x  400 y

°
2. The constraints are: ® x  y d 20
° x and y are non-negative integers. (ii)
¯
After simplification, we have:
­2 x  3 y d 75
°
® x  y d 20
° x and y are non-negative integers.
¯

­6 x  8 y t 160
°
3. The constraints are: ®4 x  2 y t 90
° x and y are non-negative integers.
¯ From the graph, P attains its maximum at
After simplification, we have: (350, 800).
­3x  4 y t 80 ɺ Maximum value of P
° 500(350)  400(800)
®2 x  y t 45
° x and y are non-negative integers. 495000
¯
! ! ! ɺ The factory should produce 35 kg of
­2 x  5 y d 100 health food A and 80 kg of health food B to
° 14 obtain a maximum profit of $495 000.
° 30
4. The constraints are: ® x  yt7
° 60 60 ­ 4 x  4 y d 3200
°̄ x and y are non-negative integers. ° 5 x  3 y d 3000
°
After simplification, we have: 6. (a) The constraints are: ®
° xt0
­2 x  5 y d 100 °¯ y t 0
°
®7 x  15 y t 210 After simplification, we have:
° x and y are non-negative integers.
¯ ­ x  y d 800
° 5 x  3 y d 3000
°
­ 80 x  90 y d 100 000 ®
° 20 x  10 y d 15 000 ° xt0
° °¯ y t 0
5. (a) The constraints are: ®
° xt0
°¯ y t 0
(b)
After simplification, we have:
­ 8 x  9 y d 10 000
° 2 x  y d 1500
°
®
° xt0
°¯ y t 0

(b)

(c) (i) $(300x  200 y)

(ii)

22 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

From the graph, P attains its maximum at 8. (a) The constraints are:
(300, 500). ­6 x  2 y d 24
ɺ Maximum value of P °
®4 x  2 y d 20
300(300)  200(500) ° x and y are non-negative integers.
¯
190000
After simplification, we have:
! ! ! ɺ The manufacturer should produce 300 kg
­3x  y d 12
of type A coffee and 500 kg of type B °
coffee to obtain a maximum daily profit of ®2 x  y d 10
$190 000. ° x and y are non-negative integers.
¯

­32 x  8 y t 160 (b)

°x d y
°
7. (a) The constraints are: ®
°x t 0
°¯ y t 0
After simplification, we have:
­4 x  y t 20
°x d y
°
®
°x t 0
°¯ y t 0

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

(b)

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

(c) Let $C be the cost, then C = 500x + 180y. ! ! ɺ The carpenter should make 2 tables and 6 chairs.
ɺ The maximum profit $[2000(2)  800(6)]
$8800

9. (a) The constraints are:

­2 x  3 y t 14
°
® x  4 y t 12
° x and y are non-negative integers.
¯

(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

23 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

(c) Let $P be the total price, then P = 100x + 300y. Level 2

11. (a) The constraints are:
­50 x  60 y d 800
°50 x  40 y d 600
°
®
°x t 0
°¯ y t 0
After simplification, we have:
­5 x  6 y d 80
°5 x  4 y d 60
°
®
°x t 0
°¯ y t 0
From the graph, P attains its minimum at (4, 2).
ɺ Tom should buy 4 ‘packages I’ and 2 ‘packages
(b)
II’.
ɺ The minimum amount paid by Tom
$[100(4)  300(2)]
$1000

10. (a) The constraints are:

­30 x  50 y t 450
°
®600 x  300 y t 6000
° x and y are non-negative integers.
¯
After simplification, we have:
­3x  5 y t 45
°
®2 x  y t 20
° x and y are non-negative integers.
¯
(c) Let $C be the profit from selling each vaccine.
(b) Total profit from selling vaccines = $C(x + y)

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

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.

From the graph, C attains its minimum at (10, 3). 12. (a) The constraints are:
ɺ The company should hire 10 buses A and ­2 x  y t 9
°x  y t 7
3 buses B. °°
ɺ The minimum cost $[450(10)  600(3)] ® x  2 y t 10
$6300 °x t 0
°
¯° y t 0

24 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

(b) (b)

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

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

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
4 3
ɺ There should be kg of food P and kg of From the graph, P attains its maximum at (40, 300).
7 7 ɺ 40 chocolate eggs and 300 chocolate rabbits
food Q in each kg of the mixture so as to should be made.
minimize the cost. ɺ The maximum profit $[4(40)  3(300)]
13. (a) The constraints are: $1060
­25 x  10 y d 4000
°25 x  20 y d 7000 14. (a) The constraints are:
°
® ­1000 x  1000 y d 80 000
°40 x  5 y d 4000 °1000 x t 10 000
°̄ x and y are non-negative integers. °
®
After simplification, we have: °1000 y t 20 000
°¯1000 y d 3(1000 x)
­5 x  2 y d 800
°5 x  4 y d 1400 After simplification, we have:
°
® ­ x  y d 80
°8 x  y d 800 ° x t 10
°̄ x and y are non-negative integers. °
®
° y t 20
°¯ y d 3x

(b)

25 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

(c) Let $P be the earnings from 1000 m2 of land for 16. (a) The constraints are:
growing soybeans, then the earnings for growing ­180 x  100 y d 2000
corns are $2P. °120 x  150 y d 2000
Total earnings = $(2Px + Py) = $P(2x + y) °°
®x d 8
° y d 10
°
°̄ x and y are non-negative integers.
After simplification, we have:
­9 x  5 y d 100
°12 x  15 y d 200
°°
®x d 8
° y d 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.

15. (a) The constraints are:

­3x  2 y d 60
° x  2 y d 48
°
®
° x  y d 25
°̄ x and y are non-negative integers.

(b)

(c) Let $P be the profit, then

P 2(180 x)  3(120 x)  2(100 y)  3(150 y)
720 x  650 y

(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
From the graph, P attains its maximum at (10, 15). Number of magnets should be produced
ɺ There should be 10 pairs of shoes and 15 pairs =180(7) + 100(7) = 1960
of boots. Number of key holders should be produced
ɺ The maximum profit $[90(10)  75(15)] 120(7)  150(7) 1890
$2025 ġ ġ ɺ The factory should produce 1960 magnets and
1890 key holders each day to attain a maximum
profit of $9590.

26 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

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

­0.8 x  0.6 y t 2
°0.2 x  0.4 y d 1
°°
®x  y d 4
°x t 0
°
°¯ y t 0
After simplification, we have:
­4 x  3 y t 10
°x  2 y d 5
°°
®x  y d 4
°x t 0 (c) Let $C be the cost of raw materials, then
° C = 5000x + 4000y.
°¯ y t 0

(b)

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

ɺ The minimum cost = $[5000(2.75) + 4000(1.5)]
$19 750
(c) Let $C be the cost, then C = 50x + 35y. <$20 000
ɺġ The claim is agreed.

19. (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.
ɺ Heal Store receives (50 – y) tonnes of medicine
from West House.
The constraints are:
From the graph, C attains its minimum at (1, 2). ­ x  y d 140
°(100  x)  (50  y ) d 40
ɺ The minimum cost $[50(1)  35(2)] °
®
$120 °0 d x d 100
 $135 °¯0 d y d 50
ɺġ The claim is disagreed. After simplification, we have:
­ x  y d 140
18. (a) The constraints are: ° x  y t 110
°
­200 x  300 y t 1000 ®
°200 x  100 y t 700 °0 d x d 100
°° °¯0 d y d 50
®150 x  50 y t 400
°x t 0
° (b)
°¯ y t 0
After simplification, we have:
­2 x  3 y t 10
°2 x  y t 7
°°
®3x  y t 8
°x t 0
°
°¯ y t 0

27 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

(c) Cost of transportation from East House 4. Since x and y are non-negative integers, the required
$(60x  80 y) possible pairs are represented by the dots in the figure
Cost of transportation from West House below.
$[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 ġ ɺ There are 9 pairs of (x, y) satisfying the constraints
$(30x  60 y  4000) . ­x  3y  9
® .ġ
¯y t1
(d)
­2 x  3 y t 6
5. The solutions of ® are represented by the
¯x  2 y d 0
shaded region in the figure below.

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

ɺ 100 tonnes and 10 tonnes of medicine are
transported from East House to Healthy Store ­x  3y  3
and Heal Store respectively. 6. The solutions of ® are represented by the
ɺġ All 40 tonnes of medicine from West House are ¯3x  2 y t 2
transported to Heal Store. shaded region in the figure below.
ɺġ The claim is agreed.

Check Yourself (p. 4.58)

1. (a) 8 (b) 9 (c) 8

2. When x = 0 and y = 0,
2x + 3 = 2(0) + 3 = 3
y=0
ɺġ y d 2x + 3
7. (a) Choose a point in the shaded region, say (0, 0).
ɺ The shaded region in the figure represents the ɻ x+y+2=0+0+2=2
solutions of the inequality y d 2x + 3. ġ ġ ɺ One inequality is x + y + 2 ≥ 0.
ɻ 3x  y + 2 = 3(0)  0 + 2 = 2
3. The solutions of x t 2 can be represented by the right
half-plane of x = 2. ġ ġ ɺ One inequality is 3x  y + 2 ≥ 0.
ɺ Region III or IV represents the solution. ɻ 3x + y  2 = 3(0) + 0  2 = 2
Choose (4, 4) as the test point. ġ ġ ɺ One inequality is 3x + y  2 ≤ 0.
When x = 4 and y = 4, ­x  y  2 t 0
x + 2y = 4 + 2(4) = 12 ‫ ح‬6 °
ɺ The system of inequalities is ®3x  y  2 t 0 .
ġ ɺ The half-plane not containing the test point (4, 4) °3x  y  2 d 0
represents the solutions of the inequality. ¯
ɺ Region IV in the figure represents the solutions of
­x t 2 (b) (i) Check the values of P x  2 y at the three
® . vertices.
¯x  2 y d 6
At (0, 2), P 0  2(2) 4
At (1, 1), P 1  2(1) 3
At (2, 4), P 2  2(4) 6
ɺ! Maximum value of P = 4
Minimum value of P = 6
(ii) Check the values of P 2x  y  1 at the three
vertices.
At (0, 2), P 2(0)  2  1 1
At (1, 1), P 2(1)  (1)  1 0
At (2, 4), P 2(2)  (4)  1 9

28 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

ɺ! Maximum value of P = 1 (b) Choose a point in the shaded region, say (0, 2).
When x = 0 and y = 2,
Minimum value of P = 9 3x + 1 = 3(0) + 1 = 1
y=2>1
Revision Exercise 4 (p. 4.60) ɺġ y > 3x + 1
Level 1 ɺġ The required inequality is y > 3x + 1.
1. (a) When x = 0 and y = 0,
x  1 0  1 1 d 0 4. (a) Choose a point in the shaded region, say (0, 2).
ɺ The half-plane containing the test point (0, 0) When x 0 and y 2 ,
together with the boundary represents the x  2 y 0  2(2) 4 d 3
solutions of the inequality. ɺ x  2 y d 3
ɺ The required inequality is x  2 y d 3 .

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

When x 0 and y 1 ,
2x  3 y  4 2(0)  3(1)  4 1 ! 0
ɺ 2x  3 y  4 ! 0

(b) When x = 1 and y = 0, ɺ The required inequality is 2x  3 y  4 ! 0 .

2x = 2(1) = 2
y=0<2 ­ x  y ! 1
ɺ The half-plane containing the test point (1, 0) 5. (a) The solutions of ® are represented by the
¯x  y t 3
represents the solutions of the inequality.
shaded region in the figure below.

2. (a) When x = 0 and y = 0,

2x  4 2(0)  4 4 ! 0
ɺ The half-plane containing the test point (0, 0)
represents the solutions of the inequality. ­ y t 3x
(b) The solutions of ® are represented by the
¯x  2 y  2
shaded region in the figure below.

(b) When x = 0 and y = 0,

3x  2y = 3(0) + 2(0) = 0 t 1
ɺ The half-plane containing the test point (0, 0)
together with the boundary represents the
solutions of the inequality.

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

29 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

­x  y  6  0 (b) Choose a point in the shaded region, say (1, 2).

° ɻ x + y + 1 = 1 + 2 + 1 = 2
6. (a) The solutions of ® x t 1 are represented by
° y t 2 ġ ġ ɺ One inequality is x + y + 1 ≥ 0.
¯ ɻ y=2≥1
the shaded region in the figure below. ġ ġ ɺ One inequality is y ≥ 1.
ɻ x = 1 ≤ 0
ġ ġ ɺ One inequality is x ≤ 0.
­x  y  1 t 0
°
ɺ The system of inequalities is ® y t 1 .
°x d 0
¯

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

ɻ x 0 ! 2
ɺ One inequality is x ! 2 .
ɻ x  2 y 0  2(0) 0 d 2
­y t 2
° ɺ One inequality is x  2 y d 2 .
(b) The solutions of ®3 x  2 y t 6 are represented by
°9 x  4 y d 27 ɻ 2x  2 y 2(0)  2(0) 0  1
¯
ɺ One inequality is 2x  2 y  1 .
the shaded region in the figure below.
ɺ The system of inequalities is
­ x ! 2
°x  2 y d 2
°
®
°2 x  2 y  1
°̄ x and y are integers.

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

ɻ 2x  3 y 2(0)  3(0) 0 t 6
ɺ One inequality is 2x  3 y t 6 .
ɻ 4x  y 4(0)  0 0 d 7
ɺ One inequality is 4x  y d 7 .
7. (a) Choose a point in the shaded region, say (4, 2).
ɻ 2x  y 2(0)  0 0 ! 2
ɻ x+3=4+3=7
y=2 ɺ One inequality is 2 x  y ! 2 .
ġ ġ ɺ One inequality is y ≤ x + 3. ɻ x  3 y 0  3(0) 0  5
ɻ 6  3x = 6  3(4) = 6 ɺ One inequality is x  3 y  5 .
y=2 ɺ The system of inequalities is
ġ ġ ɺ One inequality is y > 6  3x.
­2 x  3 y t 6
­y d x  3 °4 x  y d 7
ɺ The system of inequalities is ® . °°
¯ y ! 6  3x ®2 x  y ! 2
°x  3y  5
(b) Choose a point in the shaded region, say (2, 2). °
ɻġ x + 2y = 2 + 2(2) = 6 ≥ 4 °̄ x and y are integers.
ɺġ One inequality is x + 2y ≥ 4.
ɻġ 2x + y = 2(2) + 2 = 6 ≤ 8 10. The solutions of y ! 5x  3 are represented by the
ɺġ One inequality is 2x + y ≤ 8. shaded region in the figure below.
­x  2 y t 4
ɺġ The system of inequalities is ® .
¯2 x  y d 8

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

ɻġ x = 2 > 1
ɺġ One inequality is x > 1.
ɻġ y = 3 > 2
ɺġ One inequality is y ≥ 2.
ɻġġ x + y = 2 + 3 = 5 ≤ 6
ɺġ One inequality is x + y ≤ 6.
­x ! 1
°
ɺġ The system of inequalities is ® y t 2 .
°x  y d 6
¯

30 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

11. The solutions of 4 x  3 y  12 are represented by the ­x  y  3 t 0

shaded region in the figure below. °
16. The solutions of ® x  y  1 t 0 are represented by the
°y t 0
¯
shaded region in the figure below.

­2 x  4 y  3 d 0
°
12. The solutions of 2x d 3 y are represented by the shaded 17. The solutions of ®2 x  3 y  4 t 0 are represented by the
region in the figure below. ° x t 3
¯
shaded region in the figure below.

x
13. The solutions of  y d 1 are represented by the shaded
2
region in the figure below. 18. 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

19. Check the values of P y  3x at the four vertices.

At (2, 4), P = 4  3(2) = 10
­x  3y t 2
14. The solutions of ® are represented by the At (4, 0), P = 0  3(4) = 12
¯x  y t 1 At (3, 2), P = 2  3(3) = 7
shaded region in the figure below. At (4, 7), P = 7  3(4) = 5
ġ ɺ Maximum value of P = 12
Minimum value of P = 7

20.

­3x  2 y  6
15. 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
From the graph, P attains its minimum at (1, 1).
ɺ Minimum value of P 3(1)  2(1) 5

31 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

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

24. (a) The constraints are:

From the graph, P attains its maximum at (3, 1).
­x t 2 y
ɺ Maximum value of P 2(3)  3(1)  8 11 ° x  y d 10
°
From the graph, P attains its minimum at (1, 3). ®
ɺ Minimum value of P 2(1)  3(3)  8 1 °x t 0
°¯ y t 0

­x d 7 (b)
°
22. (a) The solutions of ® y d 6 are represented by the
°x  y  8 t 0
¯
shaded region in the figure below.

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

C = 180x + 210y.

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

vertices.
At (2, 6), P 2  2(6) 14
At (7, 6), P 7  2(6) 19 From the graph, C attains its maximum at (6.7, 3.3).
ɺ Michael should spend 6.7 hours on advertisement
At (7, 1), P 7  2(1) 9 design and 3.3 hours on web-page design.
ɺ! Maximum value of P = 19 ɺ His maximum daily income
Minimum value of P = 9 $[180(6.7)  210(3.3)]
$1899
(ii) Check the values of Q 3x  y at the three
vertices.
At (2, 6), Q 3(2)  6 0 25. (a) The constraints are:
At (7, 6), Q 3(7)  6 15 ­3x  2 y d 40
°
At (7, 1), Q 3(7)  1 20 ® x  2 y d 24
° x and y are non-negative integers.
ɺ! Maximum value of Q = 0 ¯
Minimum value of Q = 20 (b)

­y d1
°
23. (a) The solutions of ® x  y t 1 are represented by the
°x  5 y d 8
¯
shaded region in the figure below.

32 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

(c) Let $P be the profit, then P = 2400x + 2000y. 27. (a) The constraints are:
­450 x  750 y d 11 400
°
® x  y d 20
° x and y are non-negative integers.
¯
After simplification, we have:
­3x  5 y d 76
°
® x  y d 20
° x and y are non-negative integers.
¯

(b)
From the graph, P attains its maximum at (8, 8).
ɺ 8 clay sculptures and 8 wood sculptures should
be produced per week.
ɺ The maximum profit $[2400(8)  2000(8)]
$35 200

26. (a) The constraints are:

­100 x  80 y t 1000
°100 x  120 y t 1200
° (c) Let $P be the profit, then P = 240x + 300y.
®
°x t 0
°¯ y t 0
After simplification, we have:
­5 x  4 y t 50
°5 x  6 y t 60
°
®
°x t 0
°¯ y t 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

28. (a) The constraints are:

­50 x  20 y t 250
°
(c) Let $C be the cost, then C = 200x + 220y. ®y t x
° x and y are non-negative integers.
¯
After simplification, we have:
­5 x  2 y t 25
°
®y t x
° x and y are non-negative integers.
¯

(b)

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

ɺ Machines P and Q should operate for 6 hours
and 5 hours per day respectively so as to
minimize the cost.

33 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

(c) Let $C be the cost, then C = 160x + 75y. 30. (a) The constraints are:
­45 x  100 y d 10 000
°
® x d 20
° x and y are non-negative integers.
¯
After simplification, we have:
­9 x  20 y d 2000
°
® x d 20
° x and y are non-negative integers.
¯

(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 $[160(3)  75(5)]
$855

29. (a) The constraints are:

­240 x  40 y t 160
°180 x  60 y t 132
°
®
°x t 0
°¯ y t 0
After simplification, we have:
­6 x  y t 4
°15 x  5 y t 11 (c) Let $P be the profit, then P = 30 000x + 60 000y.
°
®
°x t 0
°¯ y t 0

(b)

30 000x  60 000y 0

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

From the graph, P attains its maximum at (20, 91).
ɺ There should be 20 small-sized shops and 91
large-sized shops in the shopping mall.

31. (a) The constraints are:

­0.2 x  0.3 y d 45
°
®0.7 x  0.3 y d 60
° x and y are non-negative integers.
¯
After simplification, we have:
­2 x  3 y d 450
From the graph, C attains its minimum at (0.6, 0.4). °
ɺ The customer should take 0.6 kg of food P and ®7 x  3 y d 600
° x and y are non-negative integers.
0.4 kg of food Q daily. ¯
ɺ The minimum cost $[200(0.6)  50(0.4)]
$140

34 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

(b) 33. (a)

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

must lie on the right half-plane of x = p.
(c) Let $P be the profit, then P = 8x + 6y. Therefore, from the graph, p can be any value in the
range 4  p d 5 .

­2 d x d 4
°
34. (a) The solutions of ®5 d y d 9 are represented by the
° 2 x  y ! 11
¯
shaded region in the figure below.

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

(b) (i)
Level 2
32. (a)

(b) Since x and y are integers, the required possible pairs (ii) Number of seats 29 u 2  11 u 4
are represented by the dots in the figure below. 102

35. (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.
ɺ 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.
ġ ġ ɺ There are 12 pairs of (x, y) which satisfy the
ɻ 2x  y + 2 = 2(0)  0 + 2 = 2 ≥ 0
­y  4 ġ ġ ɺ One inequality is 2x  y + 2 ≥ 0.
°
system of inequalities ® x  2 y t 8 .
­x t 0
°2 x  y d 16 °y t 0
¯ °
ɺ The system of inequalities is ® .
°x  y d 5
°¯2 x  y  2 t 0

35 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

(b) By substituting y = 0 into L3 : x  y 5 , we have (b) (i) Choose a point in the shaded region, say (0, 0).
x0 5 ɻ 2x  3y = 2(0)  3(0) = 0 ≤ 12
ɺ One inequality is 2x  3y ≤ 12.
x 5
ɻ 2x + 3y = 2(0) + 3(0) = 0 ≤ 12
ɺ Coordinates of A (5, 0)
ɺ One inequality is 2x + 3y ≤ 12.
­ L3 : x  y 5 (1) ɻ 2x  y = 2(0)  0 = 0 ≥ 4
® ɺ One inequality is 2x  y ≥ 4.
¯ L4 : 2 x  y  2 0 (2)
(1)  (2) : 3x  2 5 ɺ The system of inequalities is
x 1 ­2 x  3 y d 12
°
By substituting x = 1 into (1), we have ®2 x  3 y d 12 .
1 y 5 °2 x  y t 4
¯
y 4 (ii) Check the values of P 2x  y  1 at the three
ɺ Coordinates of B (1, 4) vertices.
At (0, 4), P = –2(0) + 4 + 1 = 5
By substituting x = 0 into (2), we have
At (6, 8), P = –2(–6) + (8) + 1 = 5
2(0)  y  2 0
At (6, 0), P = –2(6) + 0 + 1 = –11
y 2 ɺ Maximum value of P = 5
ɺ Coordinates of C (0, 2)
Minimum value of P = 11

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

­ 2 x  y t 0
At O(0, 0), P 4(0)  0 0 °
37. (a) The solutions of ® x  y d 4 are represented by the
At A(5, 0), P 4(5)  0 20 °y t 0
¯
At B(1, 4), P 4(1)  4 8
shaded region in the figure below.
At C(0, 2), P 4(0)  2 2
ɺ Maximum value of P 20
Minimum value of P 0

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

we have
2 x  3(0) 12
x 6
ɺ The coordinates of R are (6, 0).
By substituting x = 0 into the equation of L2, (b) Since x and y are integers, the feasible solutions are
we have the points indicated by the dots in the figure.
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)
x  (6) 6  (6)
y 8 8
From the graph, P attains its maximum at (1, 3).
x  6 12 ɺ The maximum value of P 5(1)  3(3)
3 y  24 2 x  12
14
2 x  3 y 12
ɻ L3 passes through P and Q.
ɺ The equation of L3:
y  (8) 4  (8)
x  (6) 0  (6)
y  8 12
x6 6
y  8 2 x  12
2 x  y 4

36 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

­y d 5 ɺġ The equation of L2:

°2 y d x  8 y6 2
° 
38. (a) The solutions of ® are represented by x2 3
°3x  5 y t 20
°¯ y t 4 x  19 3 y  18 2 x  4
2 x  3 y  22 0
the shaded region in the figure below.
(ii) Consider the y-intercept of L1.
When x = 0,
3(0)  2 y  6 0
y 3
ɺġ The coordinates of B are (0, 3).
ɻġ L3 passes through B.
ɺġ The equation of L3 is y = 3.
­ L2 : 2 x  3 y  22 0 ......(1)
®
¯ L3 : y 3 ......(2)
By substituting (2) into (1), we have
2 x  3(3)  22 0
(b) (i) Check the values of P = 7x + 4y at the four 2 x 13
vertices. 13
At (0, 4), P = 7(0) + 4(4) = 16 x
2
At (2, 5), P = 7(2) + 4(5) = 6
§ 13 ·
At (6, 5), P = 7(6) + 4(5) = 22 ɺġ The coordinates of D are ¨ , 3 ¸ .
At (5, 1), P = 7(5) + 4(1) = 31 © 2 ¹
ɺ! Maximum value of P = 16
(b) Choose a point above L3 and vertically below point
Minimum value of P = 31 C, say (2, 4).
ɻġ 3x  2y + 6 = 3(2)  2(4) + 6 = 4 ≥ 0
(ii)
ɺġ One inequality is 3x  2y + 6 ≥ 0.
ɻġ 2x + 3y  22 = 2(2) + 3(4)  22 = 6 ≤ 0
ɺġ One inequality is 2x + 3y  22 ≤ 0.
ɻġ y = 4 ≥ 3
ɺġ One inequality is y ≥ 3.
­3x  2 y  6 t 0
°
ɺġ The system of inequalities is ®2 x  3 y  22 d 0 .
°y t 3
¯

40. (a) (i) The equation of L3:

y  0 100  0
Check the values of P = 7x + 4y at the four x  0 300  0
vertices. x 3y
At (0, 4), P = 16 The equation of L4:
At (4, 6), P = 7(4) + 4(6) = 4 y  200 0  200
At (6, 5), P = 22
x0 500  0
At (5, 1), P = 31
5( y  200) 2 x
ɺ Maximum value of P 16
2 x  5 y 1000
Minimum value of P 31
­ L3 : x 3 y ......(1)
(ii) ®
L
¯ 4 : 2 x  5 y 1000 ......(2)
39. (a) (i) ɻġ L1 passes through A and C.
ɺġ The equation of L1: By substituting (1) into (2), we have
2(3 y )  5 y 1000
y6 06
11 y 1000
x  2 2  2
3 1000
y6 ( x  2) y
2 11
2 y  12 3 x  6 1000
By substituting y into (1), we have
3x  2 y  6 0 11
3000
ɻġ L1 A L2 x
1 2 11
ɺġ Slope of L2  § 3000 1000 ·
Slope of L1 3 ɺġ L3 and L4 intersect at ¨ , ¸.
ɻġ L2 passes through C. © 11 11 ¹

37 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

Choose a point above L2 and vertically below 41. (a) The constraints are:
§ 3000 1000 · § 3000 · ­5 x  3 y t 18
¨ , ¸ , say ¨ , 60 ¸ . °
© 11 11 ¹ © 11 ¹ °° 2 x  4 y t 14
ɻġ 3y = 3(60) = 180 ≤
3000 ®5 x  6 y t 30
11 °x t 0
°
ɺġ One inequality is x ≥ 3y.
¯° y t 0
§ 3000 · 9300 After simplification, we have:
ɻġ 2x + 5y 2 ¨ ¸  5(60) d 1000
© 11 ¹ 11 ­5 x  3 y t 18
ɺġ One inequality is 2x + 5y ≤ 1000. °x  2 y t 7
3000 °°
ɻġ x t 200 ®5 x  6 y t 30
11 °x t 0
ɺġ One inequality is x ≥ 200. °
ɻġ y = 60 ≥ 50 °¯ y t 0
ɺġ One inequality is y ≥ 50.
ɺġ The system of inequalities is (b)
­x t 3y
°2 x  5 y d 1000
°
® .
° x t 200
°¯ y t 50

(b) (i) The constraints are:

­x t 3y
°10 x  25 y d 5000
°°
® x t 200 (c) Let $C be the cost, then C = 10x + 8y.
° y t 50
°
°̄ x and y are non-negative integers.
After simplification, we have
­x t 3y
°2 x  5 y d 1000
°°
® x t 200
° y t 50
°
°̄ x and y are non-negative integers.

(ii) Let $F be the hourly income of the carpark,

then F = 30x + 50y. 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

42. (a) The constraints are:

­200 x  250 y d 1700
°1.2 x  1.8 y d 10.8
°
®
°x t 3
°̄ x and y are non-negative integers.

From the graph, F attains its maximum at After simplification, we have:

(375, 50). ­4 x  5 y d 34
ɺġ The maximum parking fee per hour °2 x  3 y d 18
°
$[30(375)  50(50)] ®
°x t 3
$13 750 °̄ x and y are non-negative integers.

38 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

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

(c) Let N be the total number of seats provided,

then N = 4x + 8y.

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

ɺ The bakery should make 14 kg of cakes and
13 kg of cookies each day.
ɺ The maximum profit $[80(14)  120(13)]
$2680
! $2600
ɺġ The claim is agreed.
From the graph, N attains its maximum at (3, 4).
ɺ Tom should buy 3 small tables and 4 large 44. (a) The constraints are:
tables. ­150 x  80 y d 1000
ɺ The maximum number of seats 4(3)  8(4) °4 x  y d 20
°
44 ®
° x  y d 10
°̄ x and y are non-negative integers.
43. (a) The constraints are:
After simplification, we have:
­20 x  15 y d 500
° x  2 y d 40 ­15 x  8 y d 100
°° °4 x  y d 20
°
® x  y d 27 ®
°x t 0 ° x  y d 10
° °̄ x and y are non-negative integers.
°¯ y t 0
After simplification, we have:
(b)
­4 x  3 y d 100
° x  2 y d 40
°°
® x  y d 27
°x t 0
°
°¯ y t 0

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

39 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

ɺ The maximum profit After simplification, we have:

$[30 000(2)  20 000(8)] ­ x  y d 30
° x  y t 20
$220 000 °
®
 $230 000 °0 d x d 20
ɺġ The claim is disagreed. °¯0 d y d 15

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

­108 x  72 y t 2160
° x  y t 25
°
®
°0 d x d 24
°¯0 d y d 24
After simplification, we have:
­3 x  2 y t 60
° x  y t 25
°
®
°0 d x d 24
°¯0 d y d 24
(c) Cost of transporting coal to company A
(b) $[7 x  3(20  x)]
$(4 x  60)
Cost of transporting coal to company B
$[4 y  2(15  y)]
$(2 y  30)
Let $C be the total transportation cost, then
C (4 x  60)  (2 y  30)
4 x  2 y  90

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

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

ɺ The minimum transportation cost
$[4(5)  2(15)  90]
$140

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

Challenging Questions (p. 4.71)
ɺ The minimum daily operation cost
1. (a) The constraints are:
$[100(10)  80(15)]
­10 x  30 y t 500
$2200 °
®3000 x  8000 y t 140 000
 $2400 ° x and y are non-negative integers.
¯
ɺġ The claim is agreed.
After simplification, we have:
46. (a) ɻ x tonnes of coal are sent from P to A. ­ x  3 y t 50
°
ɺ (20 – x) tonnes of coal are sent from Q to A. ®3x  8 y t 140
ɻ y tonnes of coal are sent from P to B. ° x and y are non-negative integers.
¯
ɺ (15 – y) tonnes of coal are sent from Q to B.
The constraints are:
­ x  y d 30
°(20  x)  (15  y) d 15
°
®
°0 d x d 20
°¯0 d y d 15

40 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

(b) 2. Answer: B
ɻ The straight line passes through (3, 0) and (0, 3).
ɺ Equation of the straight line:
y0 30
x  (3) 0  (3)
y
1
x3
x y3 0
ġ Choose a point in the shaded region, say (3, 3).
When x = 3 and y = 3,
x  y  3 3  3  3 3 d 0
ɺ The inequality is x – y + 3 d 0.
(c) Let $C be the cost, then C 17 000 x  48 000 y .
3. 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.

4. 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,
From the graph, C attains its minimum at (20, 10). i.e. y = x and the upper half-plane of x – y + 3 = 0,
ɺ 20 helicopters and 10 transport-troops should be i.e. y = x + 3.
used. ­y d 3
°
ɺ The minimum cost ɺ The system of the inequalities is ® y t  x ,
$[17 000(20)  48 000(10)] °y t x  3
¯
$820 000 ­y d 3
°
i.e. ® y t  x .
(d) Since the route to the quake-stricken region might be ° x  y d 3
blocked, the best way to avoid delay would be to use ¯
helicopters.
Therefore, 50 helicopters and no transport-troops 5. Answer: C
should be used. ɻ The shaded region is in the right half-plane of x 3 .
The cost = $17 000 × 50 = $850 000 ɺ a t 3
(or any other reasonable answers) ɺ I must be true.
ġ ɻġ The shaded region is in the lower half-plane of
Multiple Choice Questions (p. 4.72) y 2x  2 .
1. Answer: C
ɺ b d 2a  2
ɻ The slope of the line y = x + 5 is 1.
ɺ The line slopes downwards. 2a  b  2 d 0
Choose (0, 0) as the test point. ɺ II may not be true.
When x = 0 and y = 0, ġ ɻġ The shaded region is in the upper half-plane of
x + 5 = (0) + 5 = 5 ‫Ͳث‬ 1 32
x  5 y 32 , i.e. y x .
ɺ The half-plane not containing the test point (0, 0) 5 5
represents the solutions of the inequality. 1 32
ɺ bt a
5 5
5b  a  32 t 0
ɺ III must be true.
ɺ The answer is C.

41 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

6. Answer: A 9. Answer: A
Since x ≤ 2, regions I and II may be the answer. Check the values of C = px + qy – 2 at the four vertices.
Equation of the line passing through (0, 4) and (4, 0): At (p, q), C = p(p) + q(q) – 2 =  p2  q2  2
y4 04 At (q, p), C = p(q) + q(p) – 2 = 2
x0 40 At (p, q), C = p(p) + q(q) – 2 = p2 + q2  2
y  4 x At (p, q), C = p(p) + q(q) – 2 = p2 + q2  2
ɻ p2 > 0 and q2 > 0
x y 4
ɺ  p2  q2  2 is the minimum.
Consider x + y ≥ 4.
Use test point (1, 1), we have ɺ C attains its minimum at (p, q).
x+y=1+1=2‫خ‬4
ɺ Region I, that does not contain (1, 1), is the answer. 10. Answer: B
The feasible region R is sketched as follows:
7. Answer: C
Since x and y are integers, the required possible pairs are
represented by the dots in the figure below.

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

system of inequalities.

8. Answer: C The vertices of R are (5, 5), (3, 2) and (2, 4).
Check the values of 7x  5y at the three vertices.
­ L1 : x  2 y  12 0 (1)
® At (5, 5), 7x  5y = 7(5)  5(5) = 10
¯ L2 : y  x  9 (2) At (3, 2), 7x  5y = 7(3)  5(2) = 31
By substituting (2) into (1), we have At (2, 4), 7x  5y = 7(2)  5(4) = 34
x  2( x  9)  12 0 ɺ The maximum and minimum values of 7x  5y are 34
x  2 x  18  12 0 and 31 respectively.
3x 6 ɺ The required sum 34  (31) 3
x 2
By substituting x = 2 into (2), we have Investigation Corner (p. 4.83)
y 2  9
1. The constraints are:
7
ɺ The coordinates of the point of intersection of L1 and ­5 x  10 y d 800
°
L2 are (2, 7). ®x d y
By substituting x = 0 into (1), we have ° x and y are non-negative integers.
¯
0  2 y  12 0 After simplification, we have:
y 6 ­ x  2 y d 160
ɺ L1 intersects the y-axis at (0, 6). °
®x d y
By substituting y = 0 into (2), we have ° x and y are non-negative integers.
¯
0 x  9
x 9 2. Let the daily profit be $P, then P = 15x + 25y.
ɺ L2 intersects the x-axis at (9, 0).
Check the values of P x  2 y  3 at the four vertices.
At (0, 0), P 0  2(0)  3 3
At (0, 6), P 0  2(6)  3 9
At (9, 0), P 9  2(0)  3 6
At (2, 7), P 2  2(7)  3 13
ɺ Maximum value of P = 13

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.

42 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

3. (a) When D = 1, (b) Decrease in the maximum daily profit

the daily profit, P = 15x + (25  1)y Original max. daily profit  new max. daily profit
= 15x + 24y $[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.

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.

Exam Focus

Suggested Solutions Marks Remarks

Try a Similar Question 1 (p. 4.75)
04
(a) Slope of L1 1
40
ɺ The equation of L1:
y x  4 1A
ɻ L1 ʄ L2
1
ɺ Slope of L2 1 for either one
1
ɺ The equation of L2:
y  (1) 1[ x  (2)] 1M
y x 1
­ y t 1
°
ɺ The system of inequalities is ® y d  x  4 .
° y d x 1 1A
¯
(3)
(b) Note that the coordinates of the vertices of the shaded region are (5, –1),
(–2, –1) and (1.5, 2.5).
At (5, –1), we have P = 5 + 2(–1) = 3.
At (–2, –1), we have P = –2 + 2(–1) = –4.
At (1.5, 2.5), we have P = 1.5 + 2(2.5) = 6.5. 1M check all the vertices
ɺ The maximum value of P is 6.5.
i.e. The claim is disagreed. 1A follow through
Alternative Solution
Draw the straight line x + 2y = k on the figure, where k is a constant.
It is found that P attains its maximum value at (1.5, 2.5). 1M
ɺ Maximum value of P = 1.5 + 2(2.5) = 6.5
i.e. The claim is disagreed. 1A follow through
(2)

43 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

Suggested Solutions Marks Remarks

Try a Similar Question 2 (p. 4.76)
The feasible region R is sketched as follows:

The vertices of R are (14, 7), (7, 0) and (0, 7).

Let P = –x + 3y + k.
At (14, 7), P = –14 + 3(7) + k = 7 + k;
At (7, 0), P = –7 + 3(0) + k = –7 + k;
At (0, 7), P = 0 + 3(7) + k = 21 + k.
ɺ P attains its minimum at (7, 0).
Since the least value of P is 70, we have
7  k 70
k 77
ɺ The answer is D.
Exam-type Questions (p. 4.76)
1. (a) The equation of L1:
75
y x5 1M
30
2
y x5
3
2 x  3 y  15 0 1A
ɻ L1 ʄ L2
ɺ Slope of L2 for either one
1
Slope of L1
1
for either one
2
3
3

2
The equation of L2:
3
y 7  ( x  3)
2
2 y  14 3x  9
3x  2 y  23 0
­2 x  3 y  15 t 0
°
ɺ The system of inequalities is ®3 x  2 y  23 d 0 .
°y t 0 1A
¯
(3)

44 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

Suggested Solutions Marks Remarks

(b) Note that the coordinates of the vertices of R are (3, 7), (–7.5, 0)
§ 23 ·
and ¨ , 0 ¸ .
© 3 ¹
At (3, 7), 6x – 7y = 6(3) – 7(7) = –31.
At (–7.5, 0), 6x – 7y = 6(–7.5) – 7(0) = –45. 1M check all the vertices
§ 23 · § 23 ·
At ¨ , 0 ¸ , 6 x  7 y 6 ¨ ¸  7(0) 46 .
© 3 ¹ © 3 ¹
ɺ The least value of 6x – 7y is –45. 1A
(2)

2. (a) The shaded region is the common region of the left half-plane of
x = 7, the lower half-plane of 4x – 3y = 0 and the upper half-plane
of 4x + 3y – 40 = 0.
­x d 7
°
ɺ The system of inequalities is ®4 x  3 y t 0 . 1M + 1A
°4 x  3 y  40 t 0
¯
(2)
(b) (i) The constraints are:
­20 x d 140
°20 x t 15 y
°
®
°20 x  15 y t 200
°̄ x and y are non-negative integers.
After simplification, we have
­x d 7
°4 x  3 y t 0
°
® 1A
°4 x  3 y  40 t 0
°̄ x and y are non-negative integers.
Let $C be the total cost, then C = 5000x + 4000y. 1A

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

ɺ The minimum total cost
$[5000(7)  4000(4)] 1M
$51000
! $50000
ɺ The claim is agreed. 1A follow through

45 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

Suggested Solutions Marks Remarks

(ii) The minimum total cost
ª § 200 · º
$ «5000 ¨ ¸ 1M
¬ © 20 ¹ »¼
$50000
 $51000
ɺ The total cost will be decreased. 1A follow through
(6)

3. (a) The equations of L1 and L2 are y = 2 and x = 3 respectively.

ɻ D is equidistant from A and B.
26
ɺ y-coordinate of D 4
2
By substituting y = 4 into 2x + y = 18, we have
2 x  4 18
x 7
ɺ The coordinates of D are (7, 4).
The equation of L3:
46
y6 ( x  3) 1M
73
2 y  12  x  3
x  2 y 15 1A
­ x  2 y d 15
°2 x  y d 18
°
The system of inequalities is ® .
°x t 3
°¯ y t 2 1A
(3)
(b) Let x and y be the numbers of batches of product A and product B
produced by the factory every day respectively.
The constraints are:
­2 x  4 y d 30
°6 x  3 y d 54
°°
®x t 3
°y t 2
°
°̄ x and y are non-negative integers.
After simplification, we have:
­ x  2 y d 15
°2 x  y d 18
°°
®x t 3
°y t 2
°
°̄ x and y are non-negative integers.
Let $P be the daily profit, then P = 1000x + 1500y. 1A

46 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

Suggested Solutions Marks Remarks

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

ɺ The maximum daily profit
$[1000(7)  1500(4)] 1M
$13 000
 $15 000
ɺ A daily profit of $15 000 cannot be made. 1A follow through
(3)

4. (a) By substituting (10, 10) into L1: x + y + c = 0, we have

10  10  c 0
c 20
ɺ The equation of L1 is x + y – 20 = 0. 1A
1
Slope of L1  1
1
Slope of L2 = 2(–1) = –2
The equation of L2:
y  10 2( x  10) 1M
2 x  y  30 0 1A
(3)
(b) (i) The constraints are:
­200 x  100 y d 3000 (or 2 x  y d 30)
°
®100 x  100 y d 2000 (or x  y d 20) 1A
° x and y are non-negative integers.
¯
(ii) Use the figure in (a) and shade the feasible region.

47 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

Suggested Solutions Marks Remarks

Note that the vertices of the shaded region are (0, 0), (0, 20),
(15, 0) and (10, 10).
Let $P be the total profit from selling lunch boxes,
then P = 40x + 32y. 1A
At (0, 0), we have P = 40(0) + 32(0) = 0.
At (0, 20), we have P = 40(0) + 32(20) = 640.
At (15, 0), we have P = 40(15) + 32(0) = 600.
At (10, 10), we have P = 40(10) + 32(10) = 720. 1M check all the vertices
ɺ The maximum possible profit is $720. 1A
(6)

1500  1200 3
5. (a) Slope of L2 
0  400 4
The equation of L2:
3
y  x  1500 1M
4
3x  4 y  6000 0 1A
­ 2 x  y  2000 d 0
°3 x  4 y  6000 d 0
°
The system of inequalities is ® .
°x t 0
°¯ y t 0 1A
(3)
(b) (i) Let x and y be the numbers of cell phones P and Q
manufactured in the season respectively.
The constraints are:
­2 x  y  2000 d 0
°
®3 x  4 y  6000 d 0 1M
° x and y and non-negative integers.
¯
Note that the vertices of the shaded region are (0, 0),
(0, 1500), (400, 1200) and (1000, 0).
Let $P be the total profit, then P = 600x + 400y. 1M
At (0, 0), we have P = 600(0) + 400(0) = 0.
At (0, 1500), we have P = 600(0) + 400(1500) = 600 000.
At (400, 1200), we have P = 600(400) + 400(1200) = 720 000. 1M check all the vertices
At (1000, 0), we have P = 600(1000) + 400(0) = 600 000.
ɺ The maximum possible total profit is $720 000. 1A
(ii) Let $P′ be the new total profit, then P′ = 1200x + 400y. 1M
At (0, 0), we have P′ = 1200(0) + 400(0) = 0.
At (0, 1500), we have
P′ = 1200(0) + 400(1500) = 600 000
At (400, 1200), we have
P′ = 1200(400) + 400(1200) = 960 000
At (1000, 0), we have P′ = 1200(1000) + 400(0) = 1 200 000.
ɺ The maximum value of P′ = 1 200 000 > 960 000
ɺ The claim is disagreed. 1A follow through
(6)

48 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

Suggested Solutions Marks Remarks

6. Answer: C
a
The slope of ax + by = 0 is  .
b
ɻ a, b > 0
ɺ The slope of ax + by = 0 is negative, thus the line slopes downwards.
Choose (0, 1) as the test point.
When x = 0 and y = 1,
ax + by = a(0) + b(1) = b > 0
ɺ The half-plane containing the test point (0, 1) represents the
solutions of the inequality.
ɺ The answer is C.

7. Answer: A
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 y = x and the upper
half-plane of y = 0.
­y d 2  x ­x  y d 2
° °
ɺ The system of inequality is ® y d x , i.e. ® y d x .
°y t 0 °y t 0
¯ ¯

8. Answer: C
­4 d x d 0
The region representing ® is the common region of the
¯5 d y d 0
right half-plane of x = –4, the left half-plane of x = 0, the upper
half-plane of y = –5 and the lower half-plane of y = 0,
i.e. Regions II, IV and VI
ɻ x – 2y ≥ 0
ɺ The lower half-plane of x – 2y = 0 represents the solution of the
inequality x – 2y ≥ 0.
­x  2 y t 0
°
ɺ Regions IV and VI represent the solution of ® 4 d x d 0 .
° 5 d y d 0
¯

9. Answer: A
­0 d x d 3
ɻ The region representing ® is the common region of the
¯3 d y d 6
right half-plane of x = 0, the left half-plane of x = 3, the upper
half-plane of y = 3 and the lower half-plane of y = 6.
ɺ ːABD and ːBCD may be the answer.
ɻ The solution of x + y ≤ 6 is represented by the lower half-plane of
x + y = 6.
­x  y d 6
°
ɺ ːBCD represents the solution of ®0 d x d 3 .
°3 d y d 6
¯

49 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

Suggested Solutions Marks Remarks

10. Answer: A
Since (h, k) is a point lying in the shaded region (including the boundary),
­3 x  4 y  4 d 0
it must satisfy the system of inequalities °° x  4 y d 20 .
®
°x t 1
°̄ 2
­3h  4k  4 d 0 ......(1)
ɺ °°h  4k d 20 ......(2)
®
°h t 1 ......(3)
°̄ 2
For I:
From (1),
3h  4k  4 d 0
3h d 4( k  1)
3
k 1 t h
4
ɺ I must be true.
For II:
From (2),
h  4k d 20
h d 20  4k
ɺ II must be true.
For III:
From (3),
1
ht
2
2h t 1
ɺ III may not be true.
ɺ The answer is A.

11. Answer: D
The point (x, y) lying outside R does not satisfy one of the inequalities in
­0 d x d 5
°y t 0
°
the system ® .
° x  2 y d 15
°¯2 x  y d 10
When x = 4 and y = 6,
x + 2y = 4 + 2(6) = 16 ‫ح‬15
i.e. (4, 6) does not satisfy the inequality x + 2y ≤ 15.
ɺ (4, 6) lies outside R.

12. Answer: C
By substituting x = 0 into the equation of L1, we have
0  2y  6 0
y 3
ɺ One of the vertices is (0, 3).
By substituting y = 0 into the equation of L2, we have
2x  0  8 0
x 4
ɺ One of the vertices is (4, 0).
­ L1 : x  2 y  6 0 ......(1)
®
¯ L2 : 2 x  y  8 0 ......(2)

50 © United Prime Educational Publishing (HK) Ltd. 2024

 4 Linear Programming

Suggested Solutions Marks Remarks

(1) u 2  (2) : 4 y  12  ( y  8) 0
5 y  20 0
y 4
By substituting y = 4 into (1), we have
x  2(4)  6 0
x 2
ɺ One of the vertices is (2, 4).
Check the values of 3x + 2y – 4 at the four vertices.
At (0, 0), 3(0) + 2(0) – 4 = –4
At (4, 0), 3(4) + 2(0) – 4 = 8
At (0, 3), 3(0) + 2(3) – 4 = 2
At (2, 4), 3(2) + 2(4) – 4 = 10
ɺ Maximum value = 10; minimum value = –4
ɺ The answer is C.

13. Answer: C
The feasible region R is sketched as follows:

The vertices of R are (2, 0), (2, 6), (8, 4) and (10, –1).
Check the values of 15x + 5y + 4 at the four vertices.
At (2, 0), 15(2) + 5(0) + 4 = 34
At (2, 6), 15(2) + 5(6) + 4 = 64
At (8, 4), 15(8) + 5(4) + 4 = 144
At (10, –1), 15(10) + 5(–1) + 4 = 149
ɺ The greatest value of 15x + 5y + 4 is 149.

51 © United Prime Educational Publishing (HK) Ltd. 2024

HKDSE Mathematics in Action (3rd Edition) 5A Full Solutions

Suggested Solutions Marks Remarks

14. Answer: A
The feasible region R is sketched as follows:

The vertices of R are (–2, 10), (4, 2) and (1, –6).

Let P = –2x + 3y + a.
At (–2, 10), P = –2(–2) + 3(10) + a = 34 + a
At (4, 2), P = –2(4) + 3(2) + a = –2 + a
At (1, –6), P = –2(1) + 3(–6) + a = –20 + a
ɺ P attains maximum at (–2, 10).
Since the greatest value of P is 61, we have
34  a 61
a 27

52 © United Prime Educational Publishing (HK) Ltd. 2024