Linear Inequalities in Two Unknowns (A)

Linear Inequalities in Two Unknowns
二元一次不等式
Exercises(練習)
1. Solve the following compound inequalities graphically.

在數線上表示下列各複合不等式的解。
(a) x  2 and x < 3
(b) x < –1 and x < 5
(c) x  4 and x > –2
(d) x > 2 and x  –1
(a)
(b)
∴ The solution is:
(c)
(d)
Since there is no common region, there are no solutions.
47
Question Bank
x 29
2. Solve 5  3x  2   , and represent the solutions graphically.
2 2
x 29
解 5  3x  2   ，並在數線上表示其解。
2 2
x 29
5  3x  2 and 3x  2  
2 2
3 < 3x and 6x + 4  x + 29
x>1 and 5x  25
x>1 and x  5
∴ 1<x  5
Graphical representation:
3. Solve 2x – 5 < 9 and 3x + 5 > 17, and represent the solutions graphically.
解 2x – 5 < 9 及 3x + 5 > 17，並在數線上表示其解。
2x – 5 < 9 and 3x + 5 > 17
2x < 14 and 3x > 12
x<7 and x>4

∴ 4<x<7
2 x  y  2
4. Solve the system of inequalities  graphically.
x  2 y  4
2 x  y  2
利用圖解法解  。
x  2 y  4
48
13 Linear Inequalities in Two Unknowns
5 Solve the inequality x + 4y  4 graphically.

利用圖解法解不等式 x + 4y  4。
6. Solve the inequality x – 2y < 4 graphically.

利用圖解法解不等式 x – 2y < 4。
x  2 y  3
7. Solve the system of inequalities  x  3 y  3 graphically.
 x  2

x  2 y  3
利用圖解法解不等式組  x  3 y  3 。
 x  2

x  y

8. Solve the system of inequalities  x  2 graphically.
y  3

49
Question Bank
x  y
利用圖解法解不等式組  x  2 。
y  3

9. (a)Draw and shade the region that satisfies the following constraints:
把滿足下列約束條件的區域塗上陰影。
y  4

2 x  y  2  0
7 x  5 y  15

(b) Find the maximum value of the function P = 2x + y subject to the constraints in (a).
根據 (a) 中的約束條件，求函數 P = 2x + y 的極大值。
(a)
(b) Draw the line 2x + y = 0.
Translate the line 2x + y = 0 in the positive direction of the x-axis to obtain increasing values of P.
From the graph, P attains its maximum at (3, 4).
∴ Maximum value of P = 2(3) + 4 = 10
50
10 . (a) Draw and shade the region that satisfies the following constraints:
4 x  3 y  5  0

8 x  15 y  17  0
2 x  3 y  11

(b) Find the maximum and the minimum value of P = 4x + 2y subject to the constraints in (a) if x and y
are
(i) real numbers,
(ii) integers.
根據 (a) 中的約束條件，在下列情況中，求 P = 4x + 2y 的極大值和極小值。
(i) x 和 y 都是實數。
(ii) x 和 y 都是整數。
(a)
(b) Draw the line 4x + 2y = 0.
Translate the line 4x + 2y = 0 in the positive direction of the x-axis to obtain increasing values of P.
Translate the line 4x + 2y = 0 in the negative direction of the x-axis to obtain decreasing values of
P.
(i) From the graph, P attains its maximum at (4, 1).
∴ Maximum value of P = 4(4) + 2(1) = 18
From the graph, P attains its minimum at
(–3.5, –3).
∴ Minimum value of P = 4(–3.5) + 2(–3) = –20
51
Question Bank
(ii) x and y are integers.

From the graph, P attains its minimum at
(–2, –2).
∴ Minimum value of P = 4(–2) + 2(–2) = –12
11. A factory produces two models of sofa A and B each day subject to the following conditions:
(i) The maximum number of sofa produced by the factory each day is 35.
(ii) Each sofa A and each sofa B require 4 man-hours and 3 man-hours to make respectively. Only 120
man-hours are available each day.
(iii) Each sofa A and each sofa B require 2 units and 3 units of materials to make respectively. Only 90
units of materials are available each day.
It is given that the factory produces x sofa A and y sofa B each day.
(a) Write down all the constraints on x and y.
(b) Indicate the solutions that satisfy the constraints in (a) on a coordinate plane.
(c) If the factory makes a profit of $175 and $200 by producing each sofa A and sofa B respectively, find
the values of x and y in order to make the maximum profit. What is the maximum profit?
某工廠根據下列條件生產兩款沙發 A 和 B。
(i) 該工廠每天最多生產 35 張沙發。
(ii) 製造每張沙發 A 需要 4 個工時，而製造每張沙發 B 則需要 3 個工時。每天只有 120 個工時可供
使用。
(iii) 製造每張沙發 A 需要 2 單位材料，而製造每張沙發 B 則需要 3 單位材料。每天只有 90 單位材
料可供使用。
已知該工廠每天製造 x 張沙發 A 和 y 張沙發 B。
(a) 寫出所有關於 x 和 y 的約束條件。
(b) 在一個直角坐標平面上，標示滿足在 (a) 中所得的約束條件的區域。
(c) 若該工廠每生產一張沙發 A 和一張沙發 B 可分別賺取 $175 和 $200 的利潤，為了賺取最大的
利潤，求 x 和 y 的值。最大利潤是多少？
 x  y  35
(a) 4 x  3 y  120


2 x  3 y  90
 x and y are non -negative integers.
52
(b)
(c) Profit P = $(175x + 200y)

Draw the line 175x + 200y = 0.
Translate the line 175x + 2000y = 0 in the positive direction of the x-axis to obtain increasing
values of P.
∴ x = 15, y = 20
∴ Maximum profit = $[175(15) + 200(20)] = $6625
12. A patient needs at least 24 units of vitamin C and 20 units of vitamin E daily. The following table shows
the number of units of vitamins C and E in each gram of healthy food P and Q respectively.
Healthy food Vitamin C Vitamin E

P (per g) 4 units 2 units
Q (per g) 1 unit 3 units
It is given that each gram of healthy food P and Q cost $8 and $10 respectively. If the patient takes x g of
food P and y g of food Q in order to meet his daily vitamins needs stated above,
(a) write down all the constraints on x and y,
(b) draw and shade the region that satisfies the constraints in (a) on a coordinate plane,
(c) find the weights of food P and Q the patient takes daily so as to minimize the cost. Hence, find the
minimum cost.
一名病人每天最少需要攝取 24 單位的維他命 C 和 20 單位的維他命 E。下表所示為每 g 健康食品 P
和 Q 中分別含有的維他命數量。
53
Question Bank
健康食品維他命 C 維他命 E

P (/g) 4 單位 2 單位
Q (/g) 1 單位 3 單位
已知每 g 健康食品 P 和 Q 的成本分別為 $8 和 $10。為滿足上述維他命的攝取量，假設該病人每人

都會吃 x g 健康食品 P 和 y g 健康食品 Q。
(b) 在一個直角坐標平面上，繪出滿足在 (a) 中所得的約束條件的區域，並塗上陰影。
(c) 若要把成本減至最低，問該病人每天應分別吃多少健康食品 P 和 Q？由此，求最低成本。
4 x  y  24
(a) 2 x  3 y  20

x  0
 y  0
(b)
(c) Cost = $(8x + 10y)

Translate the line 8x + 10y = 0 in the positive direction of the x-axis to obtain increasing cost.
From the graph, the cost attains its minimum at
(5.2, 3.2).
∴ Weight of food P = 5.2g
∴ Weight of food Q = 3.2g
∴ Minimum cost = $[8(5.2) + 10(3.2)] = $73.6
54
13. The figure shows a triangle ABC, AB = (x + 1) cm, BC = (3x – 3) cm and CA = (2x – 2) cm. It is given
that the perimeter of △ABC is less than or equal to 38 cm but greater than 20 cm, find the range of the
possible values of x.
圖中所示為 △ABC，AB = (x + 1) cm，BC = (3x – 3) cm 及 CA = (2x – 2) cm。已知 △ABC 的周界小
於或等於 38 cm，但大於 20 cm，求 x 值的可能範圍。
Perimeter of ΔABC = (x + 1) + (3x – 3) + (2x – 2)

= 6x – 4
∴ 6x – 4 > 20 and 6x – 4  38
6x > 24 and 6x  42
x > 4 and x  7
∴ 4<x  7
14. A domestic electrical goods supplier has to transport 25 and 15 TV sets to shops A and B respectively
from its two warehouses P and Q. The costs of transportation from the warehouses to the shops are shown
in the following table:
To
Shop A Shop B
From
Warehouse P $25/set $15/set
Warehouse Q $5/set $10/set
It is given that there are 35 and 15 TV sets in stock in warehouses P and Q respectively. Suppose x and y
TV sets are transported to shops A and B from warehouse P respectively.
(b) Indicate the solutions that satisfy the constraints in (a) on a coordinate plane.
(c) Find the minimum total transportation cost.
某家庭電器供應商須分別運送 25 部和 15 部電視機到店舖 A 和店鋪 B。已知該電器供應商有兩個倉
庫 P 和 Q，而從各倉庫運送電視機到店鋪 A 和店鋪 B 的運費如下：
到
店鋪 A 店鋪 B
從
倉庫 P $25/部 $15/部
倉庫 Q $5/部 $10/部
已知倉庫 P 和 Q 的電視機存貨量分別為 35 部和 15 部。假設從倉庫 P 分別運送了 x 部和 y 部電視機

往店鋪 A 和店鋪 B。
55
Question Bank
(b) 在一個直角坐標平面上，標示滿足在 (a) 中所得的約束條件的區域。

(c) 求最低的總運費。
(a) ∵ x and y TV sets are transported to shops A and B from warehouses P respectively.
∴ (25 – x) and (15 – y) TV sets are transported to shops A and B from warehouses Q
respectively.
The constraints on x and y are:
 x  y  35
(25  x)  (15  y )  15

25  x  0
15  y  0

 x and y are non -negative integers.
After simplification, we have
 x  y  35
 x  y  25

 x  25
 y  15

 x and y are non -negative integers.
(b)
(c) Total transportation cost
= $[25x + 15y + 5(25 – x) + 10(15 – y)]
= $(20x + 5y + 275)
Translate the line 20x + 5y = 0 in the positive direction of the x-axis to obtain increasing cost.
From the graph, the cost attains its minimum at (10, 15).
∴ The minimum total transportation cost
= $[20(10) + 5(15) + 275]
= $550
56
15. (a) Draw and shade the region that satisfies the following constraints:
x  y  0

x  y  5
3 x  y  10

(b) (i) Find the maximum value of the function P = x + 2y + 3 subject to the constraints in (a).
(ii) Does the function P = x + 2y + 3 have minimum value? Explain briefly.
(b) (i) 根據 (a) 中的約束條件，求函數 P = x + 2y + 3 的極大值。
(ii) 問函數 P = x + 2y + 3 有沒有極小值？試說明理由。
(a)
(b) (i) Draw the line x + 2y + 3 = 0.
Translate the line x + 2y + 3 = 0 in the positive direction of the x-axis to obtain increasing values
of P.
From the graph, P attains its maximum at
(2.5, 2.5).
∴ Maximum value of P = 2.5 + 2(2.5) + 3
= 10.5
57
Question Bank
Pre-requisite Questions
預備測驗
1. Set up an inequality in x for each of the following diagrams.

下列各圖分別代表一個不等式的解，試寫出該不等式。
(a)
(b)
(c)
(a) x1
(b) x>4
7
(c) x
4
2 Solve x + 3 > 4, and represent the solution graphically.

解 x + 3 > 4，並在數線上表示其解。
x3 4
x 1

(a)
(b)
58
(c)
1
(a) x
2
(b) x > –7
(c) x < –6
4. Solve –3x + 4 < 7, and represent the solution graphically.

解 –3x + 4 < 7，並在數線上表示其解。
3 x  4  7
 3x  3
x  1
5. Solve x – 3  2, and represent the solution graphically.

解 x – 3  2，並在數線上表示其解。
x 3 2
x5
6. Solve 2x + 15  0, and represent the solution graphically.

解 2x + 15  0，並在數線上表示其解。
2 x  15  0
2 x  15
15
x
2
7. Solve 6 – 2x < 1, and represent the solution graphically.

解 6 – 2x < 1，並在數線上表示其解。
6  2x  1
5  2x
5
x
2
59
Question Bank
5
8. Solve 3x  7  , and represent the solution graphically.
2
5
解 3x  7  ，並在數線上表示其解。
2
5
3x  7 
2
9
3x  
2
3
x
2
x
9. Solve  1  0 , and represent the solution graphically.
5
x
解  1  0 ，並在數線上表示其解。
5
x
1  0
5
x5 0
x  5
10. Solve 4x – 8  –1, and represent the solution graphically.

解 4x – 8  –1，並在數線上表示其解。
4 x  8  1
4x  7
7
x
4
60

(a)
(b)
(c)
(a) x  10
(b) x > 13
(c) x  –3
12. Solve 3x – 20  –7, and represent the solution graphically.

解 3x – 20  –7，並在數線上表示其解。
3 x  20  7
3 x  13
13
x
3
13. Solve 7x + 12  –2 , and represent the solution graphically.

解 7x + 12  –2 ，並在數線上表示其解。
7 x  12  2
7 x  14
x  2
1
14. Solve 5 x  18  , and represent the solution graphically.
2
1
解 5 x  18  ，並在數線上表示其解。
2
61
Question Bank
1
5 x  18 
2
35
5x  
2
7
x
2
15. Solve –4x + 7 < 0, and represent the solution graphically.

解 –4x + 7 < 0，並在數線上表示其解。
4 x  7  0
7  4x
7
x
4
x 1 3
16. Solve   , and represent the solution graphically.
8 2 8
x 1 3
解   ，並在數線上表示其解。
8 2 8
x 1 3
 
8 2 8
x 1

8 8
x  1
17. Solve 4x – 2  –8, and represent the solution graphically.

解 4x – 2  –8，並在數線上表示其解。
4 x  2  8
4 x  6
3
x
2
62
18. Solve 7 – 2x  5, and represent the solution graphically.

解 7 – 2x  5，並在數線上表示其解。
7  2x  5
2  2x
x 1
11 2
19. Solve  5 x    , and represent the solution graphically.
6 3
11 2
. 解  5x    ，並在數線上表示其解。
6 3
11 2
 5x  
6 3
11 2
  5x
6 3
5
5x 
2
1
x
2
1 x3
20. Solve (5 x  9)  6  , and represent the solution graphically.
12 12
1 x3
解 (5 x  9)  6  ，並在數線上表示其解。
12 12
1 x3
. (5 x  9)  6 
12 12
5 x  9  72  x  3
6 x  78
x  13
63
Question Bank
x 1 7
21. Solve   , and represent the solution graphically.
3 6 6
x 1 7
解   ，並在數線上表示其解。
3 6 6
x 1 7
 
3 6 6
x 4

3 3
x4
64
Level 1 Questions
程度 1 題目
1 x 3
1. Solve 2x + 3 < 1 and   , and represent the solution graphically.
2 4 2
1 x 3
解 2x + 3 < 1 及   ，並在數線上表示其解。
2 4 2
1 x 3
2x  3  1 and  
2 4 2
x
2 x  2 and 1 
4
x  1 and x  4
∴ –4 < x < –1
2. Solve x – 3  –1 and 2x – 9  1, and represent the solution graphically.

解 x – 3  –1 及 2x – 9  1，並在數線上表示其解。
x  3  1 and 2x  9  1
x2 and 2 x  10
x2 and x5
∴ 2x5
x5
3. Solve  1  0 and 1 – x > –2, and represent the solution graphically.
3
x5
解  1  0 及 1 – x > –2，並在數線上表示其解。
3
x5
1  0 a n d 1  x  2
3
x5
1 and 3  x
3
x5  3 and x  3
x  2 and x  3
∴ –2 < x < 3
65
Question Bank
x x 2 1
4. Solve  2  1 and    , and represent the solution graphically.
3 6 3 2
x x 2 1
解  2  1 及    ，並在數線上表示其解。
3 6 3 2
x x 2 1
 2  1 and   
3 6 3 2
x 2 1 x
 1 and  
3 3 2 6
x 1
x  3 and 
6 6
x  3 and x 1
∴ –3 < x  1
5 x 3 1
5. Solve     , and represent the solution graphically.
6 3 2 6
5 x 3 1
解     ，並在數線上表示其解。
6 3 2 6
5 x 3 1
   
6 3 2 6
5 x 3 x 3 1
   and  
6 3 2 3 2 6
x 7 x 4
 and 
3 3 3 3
x  7 and x  4
∴ –7  x  –4
x 1 11
6. Solve 5 – x  6 and   , and represent the solution graphically.
2 3 6
x 1 11
解 5–x6 及   ，並在數線上表示其解。
2 3 6
x 1 11
5 x  6 and  
2 3 6
1  x and 3 x  2  11
x  1 and 3x  9
x  1 and x3
∴ –1  x < 3
66
x
7. Solve –2x + 1 < 4 and  1  0 , and represent the solution graphically.
2
x
解 –2x + 1 < 4 及  1  0 ，並在數線上表示其解。
2
x
2 x  1  4 and 1  0
2
3  2 x and x20
3
x and x2
2
3
∴  x2
2
4  4 x  1

8. Solve  x , and represent the solution graphically.
1  3  2
4  4 x  1

解  x ，並在數線上表示其解。
1
 3  2
x
4  4x  1 and 1 2
3
3  4x and 3 x  6
3
x and 3  x
4
3
∴ 3 x 
4
9. Solve –2 < 2x – 3  2, and represent the solution graphically.

解 –2 < 2x – 3  2，並在數線上表示其解。
2  2 x  3  2
2  2 x  3 and 2 x  3  2
2x  1 and 2x  5
1 5
x and x
2 2
67
Question Bank
1 5
∴ x
2 2
x
 3  1  1
10. Solve  , and represent the solution graphically.
 x  1  1
 8 2 4
x
 3  1  1
解  ，並在數線上表示其解。
 x  1  1
 8 2 4
x x 1 1
 1  1 and   
3 8 2 4
x  3  3 and  x  4  2
x  6 and 2 x
∴ 2 x6
1  2 x  11

11. Solve  x 1 1 , and represent the solution graphically.
 6  4  4
1  2 x  11

解  x 1 1 ，並在數線上表示其解。
 6  4  4
x 1 1
1  2 x  11 and  
6 4 4
10  2 x and 2x  3  3
x  5 and 2x  6
x  5 and x3
∴ x  5
68
4 x  5  2

13. Solve  1 , and represent the solution graphically.
 4 (3x  10)  1
4 x  5  2

解 1 ，並在數線上表示其解。
 4 (3x  10)  1
1
4x  5  2 and (3x  10)  1
4
4 x  7 and 3x  10  4
7
x and 3x  6
4
7
x and x  2
4
7
∴ x
4
1 x
 2  6  0
14. Solve  , and represent the solution graphically.
 x  8  1
 7
1 x
 2  6  0
解  ，並在數線上表示其解。
 x  8  1
 7
1 x x 8
 0 and  1
2 6 3
3 x  0 and ( x  8)  3
3 x and x  8  3
x3 and x5
∴ x3
15. Shade the half-plane which satisfies the given inequality.

把滿足給定的不等式的半平面塗上陰影。
(a) x+y>0
69
Question Bank
(b) x + 2y < 1
(a)
(b)
70

(a) 3x + 4y < 12
(b) x – 3y < 6
(a)
(b)
71
Question Bank

(a) 2x – 2y  –1
(b) 2x + y + 1  0
(a)
(b)
72

(a) x – 2y – 4 < 0
(b) x + y – 2  0
(a)
(b)
73
Question Bank
18. The shaded region shows the solutions of a system of inequalities. Write down the system of
inequalities.
圖中的陰影區域所示為一個不等式組的解。寫出該不等式組。
x  1

x  y  2  0
x  3 y  6  0

19. The shaded region shows the solutions of a system of inequalities. Write down the system of
inequalities.
圖中的陰影區域所示為一個不等式組的解。寫出該不等式組。
x  0
y  0


x  y  2
4 x  5 y  20
74
20. The dots in the figure show the solutions of a system of inequalities. Write down a possibility of the
system of inequalities.
圖中的黑點所示為一個不等式組的解。寫出一個可能的不等式組。
 y  1
x  y  4


4 x  y  4  0
 x and y are integers.
21. The following region shows the solution of a system of inequalities. Write down the system of
inequalities where the equations of AB, BC, CD and DA are given by:
下圖的陰影區域所示為一個不等式組的解，試寫出該不等式組。
其中AB、BC、CD 和 DA 的方程為:
 AB : x  y  2  0
 BC : x  y  10  0


CD : x  y  2  0
 DA : x  y  4  0
x  y20
x  y  10  0


x  y20
 x  y40
75
Question Bank
22. Solve the following system of inequalities graphically.

利用圖解法解下列的不等式組。
 x  2 y  2

3x  2 y  6

2 x  y  2  0

x  y 1  0

x  4 y  4  0

3x  2 y  0
76

x  y  1

2 x  y  3

x  3 y  0

3x  2 y  0
77
Question Bank

y  0

x  y  2  0
2 x  y  2


x  0

y  0
2 x  3 y  6  0


y  2

x  y  2
2 x  y  3

78

x  3

y  x
3 x  2 y  6


 y  2

2 x  y  2
2 x  y  4

79
Question Bank

0  x  2

y  0
x  y  3

33. The shaded region represents the solutions of a system of inequalities.

圖中陰影區域所示為一個不等式組的解。
(a) Find the maximum value of P  2 x  3 y  2 .

(b) Find the minimum value of P  2 x  3 y  2 .
(a) 求 P  2 x  3 y  2 的極大值。
(b) 求 P  2 x  3 y  2 的極小值。
Draw the line 2x + 3y – 2 = 0.
80
(a) From the graph, P attains its maximum at (8, 4).

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

∴ Minimum value of P = 2(3) + 3(2) – 2 = 10
34. The black dots in the figure represent the solutions of a system of inequalities.
圖中的黑點所示為一個不等式組的解。
(a) Find the maximum value of P  2 x  4 y .

(b) Find the minimum value of P  2 x  4 y  3 .
(a) 求 P  2 x  4 y 的極大值。
(b) 求 P  2 x  4 y  3 的極小值。
Draw the line 2x – 4y = 0.
(a) From the graph, P attains its maximum at (7, 1).

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

∴ Minimum value of P = 2(3) – 4(7) + 3 = –19
81
Question Bank
35. The shaded region represents the solutions of a system of inequalities.

圖中陰影區域所示為一個不等式組的解。
(a) Find the system of inequalities that has the solutions represented by the shaded region.
(b) Find the minimum value of C  2 x  y  1 .
(a) 求該不等式組。
(b) 求 C  2 x  y  1 的極小值。
x  1

(a) y 1
x  y  5  0

(b) Draw the line 2x + y + 1 = 0.
From the graph, C attains its minimum at (1, 1).

∴ Minimum value of C = 2(1) + (1) + 1 = 4
36. The vitamin B content in 1 g of medicine P and 1 g of medicine Q are shown in the table.
vitamin B1 vitamin B6 vitamin B12

medicine P 20 30 30
medicine Q 30 20 10
Suppose a patient has to take vitamin B through medication. The minimum intake of vitamin B
through medication for the patient is 120, 180 and 120 units of vitamin B1, B6 and B12 respectively. If
the patient takes x g of medicine P and y g of medicine Q as the only source of vitamin B, write down
all the constraints on x and y.
下表所示為 1 g 的藥物 P 和 1 g 的藥物 Q 所含的維他命 B。
82
維他命 B1 維他命 B6 維他命 B12

藥物 P 20 30 30
藥物 Q 30 20 10
假設一名病人的療程中須服用維他命 B，而他所需的維他命 B1、B6 和 B12 的量分別是 120、

180 和 120 單位。若病人的維他命 B 來源只有 P 和 Q 兩種藥物，寫出所有關於 x 和y 的
約束條件。
The constraints are:
x  0
y  0

20x  30 y  120
30x  20 y  180

30x  10 y  120
37. A craftsman makes tables and chairs, 10 hours a day and six days a week. There are 40 units of wood
available. He needs 2 units of wood and 4 hours to make a table; 1 unit of wood and 3 hours to make a
chair.
Suppose he makes x tables and y chairs in a week.
(a) Complete the following table.
wood (units) working hours

x tables
y chairs
(b) Write down all the constraints on x and y.
一名製造桌子和椅子的工匠，每週工作六天，每天工作 10 小時。現有 40 單位的木材。他需
要 2 單位的木材和 4 小時來製造一張桌子。而製造一張椅子則需要 1 單位的木材和 3 小時。
假設他在一週內製造 x 張桌子和 y 張椅子。
(a) 試完成下表。
木材 (單位) 工時
x 張桌子
y 張椅子
(b) 寫出所有關於 x 和 y 的約束條件。

. (a)
wood (units) working hours
x tables 2x 4x
y chairs y 3y
(b) The constraints are:
2 x  y  40

4 x  3 y  60
 x and y are non - negativeintegers.

83
Question Bank
38. A baker makes two kinds of chocolate cakes, A and B. Each cake A is made of 5 eggs, 250 g of
chocolate and 560 g of flour. Each cake B is made of 10 eggs, 200 g of chocolate and 800 g of flour.
There are 60 eggs, 5 kg of chocolate and 10 kg of flour available. If the baker makes x cake A and y
cake B, write down all the constraints on x and y.
一名麵包師傅製造 A 和 B 兩種巧克力蛋糕。每個蛋糕 A 由 5 隻雞蛋、250 g 的巧克力和 560 g
的麵粉製成而每個蛋糕 B 則由 10 隻雞蛋、200 g 的巧克力和 800 g 的麵粉製成。現有 60隻雞
蛋、5 kg 的巧克力和 10 kg 的麵粉。若麵包師傅造了 x 個蛋糕 A 和 y 個蛋糕 B，寫出所有關
於 x 和 y 的約束條件。
x  0
y  0

5 x  10 y  60
250x  200y  5000

560x  800y  10000
84
Level 2 Questions
程度 2 題目

x  3 y  4

2 x  y  2
3 x  4 y  12


x  y  0

x  4 y  0
x  y  4

85
Question Bank
3. The figure shows the graphs of y  3 , y  1 , x  1 and x  4 .

圖中所示為 y  3 、 y  1 、 x  1 和 x  4 的圖像。
(a) Add a straight line x  y  3 on the graph.

 1  x  4

(b) Shade the region which represents the solutions of  1  y  3 .
x  y  3

(c) If (x, y) is one of the solutions where x and y are positive integers, list all the ordered pairs (x, y).
(a) 在圖中繪出直線 x  y  3 。
 1  x  4

(b) 把滿足不等式組  1  y  3 的區域塗上陰影。
x  y  3

(c) 若 (x, y) 是其中的一個解，其中 x 和 y 是正整數，列出所有序偶 (x, y)。
(a)
(b)
(c) (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2),
(3, 3), (4, 1), (4, 2), (4, 3)
86
4. In the figure, (0, 0), (2, 4), (4, 2) are three vertices of the region bounded by the straight lines L1, L2
and L3.
在圖中，(0, 0)、(2, 4)、(4, 2) 是由直線 L1、L2 和 L3 所包圍的區域的三個頂點。
(a) Find the equations of L1, L2 and L3.

(b) Write down a system of inequalities if the shaded region represents its feasible solutions.
(a) 求 L1、L2 和 L3 的方程。
(b) 若陰影區域表示一個不等式組的可行解，寫出該不等式組。
(a) L1 passes through (0, 0) and (2, 4).
40
Slope of L1 = =2
20
The equation of L1:
y – 0 = 2(x – 0)
y = 2x
L2 passes through (0, 0) and (4, 2).

20 1
Slope of L2 = =
40 2
The equation of L2:
1
y–0= (x – 0)
2
1
y= x
2
L3 passes through (2, 4) and (4, 2).
24
Slope of L3 = = –1
42
The equation of L3:
y – 4 = –1(x – 2)
y = –x + 6
 y  2x
 1
(b) y  x
 2
 x  y  6
87
Question Bank
x  2 y  1  0

5. It is given that  x  y  3 .
x  4

(a) Solve the system of inequalities graphically.
(b) List all the solutions (x, y) of the system of inequalities
(i) if x and y are integers.
(ii) if x and y are integers and y < 1.
x  2 y  1  0

已知  x  y  3 。
x  4

(a) 利用圖解法解該不等式組。
(b) 在下列情況中，列出該不等式組所有的解 (x, y)。
(i) x 和 y 都是整數。
(ii) x 和 y 都是整數及 y < 1。
(a)
(b) (i) (3, 0), (3, 1), (4, –1), (4, 0), (4, 1)
(ii) (3, 0), (4, –1), (4, 0)
6. Two shaded regions are shown in the figure.

圖中所示為兩個陰影區域。
88
(a) Write a system of inequalities with region (A) as its solutions.

(b) Write a system of inequalities with region (B) as its solutions.
(c) At the point of which region does the function x – 2y attain its maximum value?
(a) 寫出一個不等式組，其中區域 (A) 是該不等式組的解。
(b) 寫出一個不等式組，其中區域 (B) 是該不等式組的解。
(c) 函數 x – 2y 會在哪一個區域中的點達至其極大值？
 x  2

(a) Region A:  y  0
x  y  0

 x  2

y  0
(b) Region B: 
x  y  0
 x  y  3
(c) Translate the line x – 2y = 0 in the positive direction of the x-axis to obtain increasing values
of x – 2y. x – 2y attains its maximum in region B.
7 (a) Draw and shade the region that satisfies the following constraints:
x  0

x  3 y  6  0
x  y  2  0

(b) Find the maximum value of P = x + y subject to the constraints in (a).
根據 (a) 中的約束條件，求 P = x + y 的極大值。
(a)
(b) Draw the line x + y = 0.
89
Question Bank

∴ Maximum value of P = 0 + 2 = 2
x  0

x  2 y  2
2 x  3 y  6

(b) (b) Find the maximum value of P = x + 2y subject to the constraints in (a).
根據 (a) 中的約束條件，求 P = x + 2y 的極大值。
(a)
(b) Draw the line x + 2y = 0.
90

∴ Maximum value of P = 0 + 2(2) = 4
x  3
y  0


2 x  3 y  9
3 x  2 y  2
(b) Find the maximum value of P = 2x + y subject to the constraints in (a).

根據 (a) 中的約束條件，求 P = 2x + y 的極大值。
(a)
(b) Draw the line 2x + y = 0.
91
Question Bank

∴ Maximum value of P = 2(3) + 1 = 7
x  0

x  2 y  4  0
7 x  2 y  14  0

(b) Find the maximum value of P = x + 3y subject to the constraints in (a).
根據 (a) 中的約束條件，求 P = x + 3y 的極大值。
(a)
92
From the graph, P attains its maximum at (3, 3.5).

∴ Maximum value of P = 3 + 3(3.5) = 13.5
3x  2 y  2  0

3x  5 y  15  0
3x  5 y  15  0

(b) Find the minimum value of P = x + 2y subject to the constraints in (a).
根據 (a) 中的約束條件，求 P = x + 2y 的極小值。
(a)
93
Question Bank
From the graph, P attains its minimum at (5, 0).

∴ Minimum value of P = 5 + 2(0) = 5
x  y  3  0

x  3 y  2  0
3x  2 y  12  0

(b) Find the maximum and the minimum values of P = 2x – 3y subject to the constraints in (a) if x
and y are integers.
根據 (a) 中的約束條件，若 x 和 y 都是整數，求 P = 2x – 3y 的極大值和極小值。
(a)
(b) Draw the line 2x – 3y = 0.
94
The feasible solutions are the points in the shaded region with integral x- and y- coordinates.
From the graph, P attains its maximum at (1, –4).

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

∴ Minimum value of P = 2(–2) – 3(0) = –4
x  3 y  6  0

5 x  2 y  8  0
2 x  y  5  0

(b) Find the maximum and the minimum values of P = 3x + 2y subject to the constraints in (a).
根據 (a) 中的約束條件，求 P = 3x + 2y 的極大值和極小值。
(a)
(b) Draw the line 3x + 2y = 0.
95
Question Bank

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

∴ Minimum value of P = 3(2) + 2(–1) = 4
14. A triangular region ABC is bounded by three straight lines AB, BC and CA:
AB : x  5 y  13  0
BC : 4 x  5 y  2  0
CA : x  2
(a) Find the three vertices of the triangular region.
(b) Write a system of linear inequalities with the triangular region as the region of feasible solutions.
(c) Hence, find the maximum value of 2x + 3y subject to the constraints found in (b).
一個三角區域 ABC 由三條直線 AB、BC 和 CA 所圍成：
AB : x  5 y  13  0
BC : 4 x  5 y  2  0
CA : x  2
(a) 求三角區域的三個頂點。
(b) 若三角區域表示一個不等式組的可行解，寫出該不等式組。
(c) 由此，根據在 (b) 中的約束條件，求 2x + 3y 的極大值。
(a) Solving AB and CA for the vertex A:
 x  5 y  13  0

x  2
By substituting x = 2 into x – 5y + 13 = 0, we have
2 – 5y + 13 = 0
y=3
∴ The coordinates of A = (2, 3)
Solving AB and BC for the vertex B:
 x  5 y  13  0 ......( 1)

4 x  5 y  2  0 ......( 2)
96
(1) + (2),
5x + 15 = 0
x = –3
By substituting x = –3 into (1), we have
–3 – 5y + 13 = 0
y=2
∴ The coordinates of B = (–3, 2)
Solving BC and CA for the vertex C:
4 x  5 y  2  0

x  2
By substituting x = 2 into 4x + 5y + 2 = 0, we have
4(2) + 5y + 2 = 0
y = –2
∴ The coordinates of C = (2, –2)
x  2

(b)  x  5 y  13  0
4 x  5 y  2  0

(c) Draw and shade the region that satisfies the inequalities in (b).
From the graph, 2x + 3y attains its maximum at A(2, 3).

∴ Maximum value of 2x + 3y = 2(2) + 3(3) = 13
97
Question Bank
15. In a professional examination, candidates should attempt two papers, paper A and paper B. There are
10 questions in each paper. The following table shows the marks and time required for each question
in the two papers.
marks time (min)

paper A 9 16
paper B 15 20
2
Each candidate must attempt at least any 9 questions from the two papers in 2 hours. Under this
3
condition, a candidate attempts x questions in paper A and y questions in paper B. Assume the
candidate answers each question correctly.
(a) How many questions in each paper should he attempt in order to maximize his total score?
(b) What is the maximum total score?

在一個專業考試中，考生須回答 A 和 B 兩份考卷。每份考卷各有 10 題題目。下表所示為作
答兩份考卷中各題的分數和所需的時間。
分數時間（分）
考卷 A 9 16
考卷 B 15 20
2
每位考生須在 2 小時內回答兩份考卷中任意最少 9 題題目。有一名考生按這限制在考卷 A
3
中回答了 x 題題目，在考卷 B 中則回答了 y 題題目。假設考生答對全部題目。
(a) 要取得最高分數，他須在每份考卷中分別回答多少題題目？
(b) 最高的總分是多少？
 x  10

 y  10
(a) The constraints are: x  y  9
16x  20 y  160

 x and y are non - negativeintegers.
Score = 9x + 15y
Draw and shade the region that satisfies the constraints and maximize the scores.
98
From the graph, 9x + 15y attains its maximum at (5, 4).

∴ He should attempt 5 questions in paper A and 4 questions in paper B.
(b) The maximum total score

= 9(5) + 15(4)
= 105
16. A fat man on a diet needs at least 20, 24 and 24 units of protein, carbohydrate and dietary fibre
respectively per day. A unit of food P of price $9 contains 10, 4 and 2 units of protein, carbohydrate
and dietary fibre respectively. A unit of food Q of price $6 contains 2, 4 and 8 units of protein,
carbohydrate and dietary fibre respectively.
(a) Suppose he eats x units of P and y units of Q per day only, write down a system of inequalities
on x and y.
(b) Solve the inequalities graphically and shade the region of feasible solutions.
(c) How much of each food does he need to eat each day to meet his dietary need at a minimum
cost?
一名減肥中的胖子每天需要攝取的蛋白質、碳水化合物和食用纖維的最低量分別為 20、24 和
24 單位。每單位食品 P 售 $9，所含的蛋白質、碳水化合物和食用纖維量分別為 10、4 和 2
單位。另一種食品 Q 每單位售 $6，所含的蛋白質、碳水化合物和食用纖維量分別為 2、4 和
8 單位。
(a) 假設他每天只進食 x 單位的食品 P 和 y 單位的食品 Q，寫出一個關於 x 和 y 的不等
式組。
(b) 利用圖解法解該不等式組，並把可行解區域塗上陰影。
(c) 他每天分別要進食多少食品 P 和 Q，才能以最低花費滿足每天所需的營養攝取量？
99
Question Bank
x  0

 y  0
(a) 10x  2 y  20
4 x  4 y  24

2 x  8 y  24
(b) Graphical solution to the inequalities in (a):
(c) Cost of food = $(9x + 6y)

Draw the line 9x + 6y = 0. (See the figure in (b).)
From the graph, 9x + 6y attains its minimum at (1, 5).

∴ He should eat 1 unit of P and 5 units of Q each day to meet his dietary need at a minimum cost.
17. 10 g of alloy F contains 2 g of copper, 1 g of zinc and 1 g of lead; 10 g of alloy G contains 1 g of

copper, 1 g of zinc and 3 g of lead. It is required to produce a new alloy which contains at least 10 g of
copper, 8 g of zinc and 12 g of lead. Alloy G costs 1.5 times as much per gram as alloy F.
Find the amounts of alloy F and alloy G which must be mixed in order to produce the new alloy in the
cheapest possible way.
10 g 的合金 F 含有 2 g 的銅、1 g 的鋅和 1 g 的鉛；10 g 的合金 G 則含有 1 g 的銅、1 g 的
鋅和 3 g 的鉛。現需要生產一種新的合金，其中必須包含最少 10 g 的銅、8 g 的鋅和 12 g 的
鉛。合金 G 的成本是合金 F 的 1.5 倍。
要以最低成本生產這種新的合金，需要多少合金 F 和合金 G？
Let x g of alloy F and y g of alloy G are mixed to produce the new alloy.

x  0

y  0
 2 x  1 y  10
10 10

 1 x 1 y8
10 10
1 3
 x y  12
 10 10
100
x  0

 y  0
2 x  y  100
 x  y  80

 x  3 y  120
Let the cost of each g of alloy F be $k.
Cost of 1 g of alloy G = $1.5k
Cost of alloys F and G = $(xk + 1.5yk)
= $(x + 1.5y)k
3
Draw and shade the region that satisfies the constraints and draw the line x  y  0.
2
∴ 60 g of alloy F and 20 g of alloy G should be mixed to produce the new alloy.
18. A manufacturer employs 5 skilled workers and 10 semi-skilled workers to produce products in two
qualities, the deluxe model and the ordinary model. It requires a skilled worker 2 hours and a
semi-skilled worker 2 hours to make a deluxe product; and it requires a skilled worker 1 hour and a
semi-skilled worker 3 hours to make an ordinary product. Every worker work 8 hours or less per day.
Suppose the profit of a deluxe product is $100 and that of an ordinary one is $80. How many of each
type should be produced each day in order to maximize the total daily profit?
一個生產商僱用了 5 名熟手技工，10 名半熟手技工來製造一批高價產品和一批低價產品。製造
一件高價產品需要兩批技工各工作 2 小時。製造一件低價產品則需要熟手技工工作 1 小時和半
熟手技工工作 3 小時。每名技工每天工作不多於 8 小時。設一件高價產品的利潤為 $100，而
一件低價產品的利潤則為 $80。要獲得最大的利潤，這兩種產品每天的產量應各為多少？
Let the manufacturer produces x units of the deluxe model and y units of the ordinary model.

2 x  y  40

2 x  3 y  80
 x and y are non - negativeintegers.

101
Question Bank
Profit = $(100x + 80y)
Draw and shade the region that satisfies the constraints and draw the line 100x + 80y = 0.
From the graph, the profit attains its maximum at (10, 20).
∴ The manufacturer should produce 10 units of the deluxe model and 20 units of the ordinary model each day in
order to maximize the total daily profit.
19. A company manufactures two products.

Product P is made by mixing chemicals A, B and C in a ratio 4 : 1 : 2 by weight.
Product G is made by mixing chemicals A, B and C in a ratio 3 : 1 : 3 by weight.
The profit of making and selling 1 kg of product P is $40 and that of product G is $45. Suppose 240
kg of A, 70 kg of B and 180 kg of C are available, x kg of P and y kg of Q are made.
(a) Complete the following table and write down all the inequalities on x and y.
product P (x kg) product G (y kg)

content of chemical A (kg)
content of chemical B (kg)
content of chemical C (kg)
(b) Find the maximum profit.

一間公司生產兩種產品。
產品 P 由三種化學品 A、B 和 C 按 4 : 1 : 2 重量比混合而成。
產品 G 由三種化學品 A、B 和 C 按 3 : 1 : 3 重量比混合而成。
生產和出售 1 kg 產品 P 和 G 的利潤分別為 $40 和 $45。現有 240 kg 的 A、70 kg 的 B 和
180 kg 的 C，可生產 x kg 的 P 和 y kg 的 Q。
(a) 完成下表，並寫出所有關於 x 和 y 的約束條件。
產品 P (x kg) 產品 G (y kg)
化學品 A 的成分 (kg)
化學品 B 的成分 (kg)
化學品 C 的成分 (kg)
102
(b) 求最大利潤。
(a)
P (x kg) G (y kg)
4 3
content of A (kg) x y
7 7
1 1
content of B (kg) x y
7 7
2 3
content of C (kg) x y
7 7
x  0

y  0
4 x  3
y  240
7 7

1 x  1
y  70
7 7
2 3
 x y  180
7 7
x  0

 y  0
4 x  3 y  1680
 x  y  490

2 x  3 y  1260
(b) Profit = $(40x + 45y)

∴ The maximum profit
= $[40(210) + 45(280)]
= $21000
103
Question Bank
20. A supermarket has two brands of sweets with wine, mint and nuts centres in stock. The composition
of each brand of sweets is listed in the table below.
wine centres mint centres nuts centres

a box of brand A (100 g) 25% 25% 50%
a box of brand B (100 g) 50% 25% 25%
The cost of brand A is $60 per box and that of brand B is $100 per box. The supermarket wants to
combine x boxes of brand A and y boxes of brand B to make a new package containing at least 100 g
of sweets with wine centres, 75 g with mint centres and 100 g with nuts centres.
(b) What is the least cost of the new package of sweets?
一間超級市場出售兩種糖果盒，每種糖果盒皆有酒心、薄荷和果仁三種口味。下表所示為兩種
糖果盒中的糖果分量。
酒心薄荷果仁
A 牌糖果盒 (100 g) 25% 25% 50%
B 牌糖果盒 (100 g) 50% 25% 25%
每盒 A 牌糖果盒的成本為 $60，而每盒 B 牌糖果盒的成本則為 $100。超級市場打算把 x 盒

A 牌糖果盒和 y 盒 B 牌糖果盒混合，推出一種新包裝的糖果盒，每盒須有最少 100 g 酒心糖
果、75 g 薄荷糖果和 100 g 果仁糖果。
(b) 這種新包裝的糖果最低成本為多少？
(a) The constraints are:
x  0

 y  0
(0.25x  0.50 y )  100  100
(0.25x  0.25 y )  100  75

(0.50x  0.25 y )  100  100

x  0

 y  0
x  2 y  4
x  y  3

2 x  y  4
(b) Cost of the new package

= $(60x + 100y)
104
∴ The least cost of the new package
= $[60(2) + 100(1)]
= $220
105
Question Bank
Level 2 Questions
程度 2 題目
1. A company plans to send Christmas cards to its customers. A box of card A costs $25 and it contains
20 cards. A box of card B costs $37.5 and it contains 40 cards. The company decides not to spend
more than $300 to buy at least 240 cards for its customers and plans to buy at least 3 boxes of each but
not more than 10 boxes altogether.
(a) If the company buys x boxes of card A and y boxes of card B, what are the constraints on x and
y?
(b) Solve the constraints in (a) graphically and hence list all the integral ordered pairs (x, y) that
satisfy the constraints.
(c) What is the minimum cost for buying Christmas cards?
(d) Suppose free delivery is provided for a purchase of $300 or above. The company then decides to
spend exactly $300 on the purchase of the cards.
(i) Find the number of boxes of card A card B the company should buy respectively.
(ii) Find the greatest number of cards the company can buy.
一間公司計劃寄出聖誕卡給客戶。一盒 20 張的聖誕卡 A 的售價為 $25，而一盒 40 張的聖
誕卡 B 的售價則為 $37.5。公司須購買至少 240 張聖誕卡給客戶，成本預算最多為 $300。公
司計劃每款聖誕卡最少購買 3 盒，但合共不會買超過 10 盒。
(a) 若該公司買了 x 盒聖誕卡 A 和 y 盒聖誕卡 B，寫出所有關於 x 和 y 的約束條件。
(b) 利用圖解法解 (a) 中的約束條件，由此列出所有滿足這些約束條件的序偶 (x, y)。
(c) 購買聖誕卡的最低消費是多少？
(d) 設購物滿 $300 或以上可獲免費送貨服務，於是公司決定花費剛好 $300 來購買聖誕卡。
(i) 聖誕卡 A 和 B 各應購買多少盒？
(ii) 該公司最多可購買多少張聖誕卡？
(a) The constraints are:
x  3

y  3
 x  y  10

20x  40 y  240
25x  37.5 y  300

 x and y are positiveintegers.
(b)
106
Integral ordered pairs (x, y):
(3, 5), (3, 6), (4, 4), (4, 5), (5, 4), (6, 3), (6, 4), (7, 3)
(c) Cost = $(25x + 37.5y)

∴ The minimum cost
= $[25(4) + 37.5(4)]
= $250
(d) (i) From the graph, the cost is exactly $300 at (3, 6) and (6, 4).
The company should buy 3 boxes of card A and 6 boxes of card B or 6 boxes of card Aand 4 boxes of card B.
(ii) When (x, y) = (3, 6),

number of cards = 3(20) + 6(40) = 300
When (x, y) = (6, 4),
number of cards = 6(20) + 4(40) = 280

∴ The company can buy at most 300 cards.
2. In an activity day, 400 senior-form students have a picnic in Clear Water Bay while 500 junior-form
students have activities in Victoria Park. A fast-food restaurant with branches A and B receives an
order to supply lunch boxes to the students. Branch A can supply 700 lunch boxes and branch B can
supply 400 lunch boxes. The service charges are shown in the table below.
To Clear Water Bay To Victoria Park

From Branch A $2 per box $1 per box
From Branch B $1 per box $0.5 per box
Suppose x lunch boxes are supplied from Branch A to Clear Water Bay, and
y lunch boxes are supplied from Branch A to Victoria Park.
(b) Find the total service charge in terms of x and y.
(c) How should the delivery be made in order to obtain the most service charges?
活動日當天，400名高年級學生到清水灣郊遊，而 500名低年級學生則到維多少亞公園遊玩。一
間快餐店接獲訂單，要為這些學生供應午飯飯盒。該快餐店共有兩間分店，A 和 B。A 店可以
供應 700 個飯盒，而 B 店則可供應 400 個飯盒。下表所示為兩間店收取的服務費。
到清水灣到維多利亞公園
A 店送貨每個飯盒 $2 每個飯盒 $1
B 店送貨每個飯盒 $1 每個飯盒 $0.5
設 A 店供應 x 個飯盒到清水灣及 y 個飯盒到維多利亞公園。
107
Question Bank

(b) 以 x 和 y 表示總服務費。
(c) 要獲得最多的服務費，快餐店應如何送貨？
. (a) Since x lunch boxes are supplied to Clear Water Bay from branch A, (400 – x) lunch boxes should be supplied from
branch B.
Since y lunch boxes are supplied to Victoria Park from branch A, (500 – y) lunch boxes should be supplied from
branch B.

 x  y  700

(400  x)  (500  y )  400
400  x  0
500  y  0

 x and y are non - negativeintegers.
 x  y  700

 x  y  500
 x  400
 y  500

(b) Total service charge

= $[2x + y + (400 – x) + 0.5(500 – y)]
= $(x + 0.5y + 650)
(c) Draw and shade the region that satisfies the constraints and draw the line 2x + y = 0.
From the graph, the service charge attains its maximum at (400, 300).
∴ Branch A should deliver 400 and 300 lunch boxes to Clear Water Bay and Victoria Park
respectively; branch B should deliver 200 lunch boxes to Victoria Park.
108
3. A bakery bakes and sells two kinds of cakes, the chocolate cake and the cheesecake. The selling prices
of one piece of chocolate cake and cheesecake are $5 and $8 respectively. A piece of chocolate cake is
made of 3 parts chocolate, 2 parts sugar, 2 parts cream cheese, flour and water. A piece of cheesecake
is made of 4 parts sugar, 5 parts cream cheese, flour and water. The cakes can be sold in fractions.
Sarah buys chocolate cakes and cheesecakes as snack everyday. Sarah wants to eat at least 6 parts
chocolate, 10 parts sugar and 8 parts cream cheese from the snack everyday.
(a) Let x and y be the numbers of pieces of chocolate cake and cheesecake Sarah eats every day.
Write down the objective function to be optimized and the constraints on the objective
function so that Sarah can minimize her expense on the cakes.
(b) Using graphical methods, find the quantity of chocolate cake and cheesecake to meet the Sarah’s
need at a minimum expense. Hence find the minimum expense.
The baker buys the raw materials including 600 parts chocolate, 1000 parts sugar and 800 parts cream
cheese from a supplier. The supplier knows the contents of chocolate cake and cheesecake. He wants
to sell the raw materials at the highest price the baker can afford. The highest cost of the raw materials
the baker can afford is 20% of the selling price of the cakes.
(c) Let u1, u2 and u3 be the prices of each part of chocolate, sugar and cream cheese respectively.
Write down the objective function to be optimized and the constraints on the objective function
so that the supplier can maximize its income by selling the raw materials.
一個麵包師傅製造及售賣巧克力蛋糕和芝士蛋糕。一件巧克力蛋糕售 $5，而一件芝士蛋糕售
$8。一件巧克力蛋糕由 3 份巧克力、2 份糖、2 份忌廉芝士、麵粉和水製成，而一件芝士蛋糕
則由 4 份糖、5 份忌廉芝士、麵粉和水製成。每件蛋糕均可切開出售。美寶每天都會購買巧克
力蛋糕和芝士蛋糕作小吃，並每天最少會吃 6 份巧克力、10 份糖和 8 份忌廉芝士。
(a) 設美寶每天吃 x 件巧克力蛋糕和 y 件芝士蛋糕。
寫出需優化的目標函數及相關的約束條件，讓美寶能夠把購買蛋糕的花費減到最低。
(b) 若美寶要儘量省錢，利用圖解法求她每天可吃多少件巧克力蛋糕和芝士蛋糕。由此求最低
消費。
麵包師傅從供應商購入材料製造蛋糕，包括 600 份巧克力、1000 份糖和 800 份忌廉芝士。該

供應商清楚知道製造巧克力蛋糕和芝士蛋糕的成分。他希望以麵包師傅能夠負擔的最高價錢售
出材料。而麵包師傅能夠負擔的最高材料價錢是蛋糕售價的 20%。
(c) 設 u1、u2 和 u3 為每份巧克力、糖和忌廉芝士的價錢。寫出需優化的目標函數及相關的約
束條件，讓供應商能夠賺取最高收入。
(a) The objective function to be optimized is Sarah’s expense on cakes.
Expense on cakes
= $(5x + 8y)
109
Question Bank
3 x  6

2 x  4 y  10

2 x  5 y  8
 x, y  0
(b) Draw and shade the region that satisfies the constraints and draw the line 5x + 8y = 0.
From the graph, the expense attains its minimum at (2, 1.5).
Minimum expense on cakes
= $[5(2) + 8(1.5)]
= $22
Sarah can minimize her expense by buying 2 pieces of chocolate cake and 1.5 pieces of cheesecake. The minimum
expense is $22.
(c) The objective function to be optimized is baker’s expense on raw materials.

Price of raw materials
= 600u1  1000u 2  800u3
20% of the selling price of one piece of chocolate cake
= 0.2 × $5
= $1
20% of the selling price of one piece of cheesecake
= 0.2 × $8
= $1.6

3u1  2u1  2u 3  1

4u 2  5u 3  1.6
u , u , u  0
 1 2 3
110
4. A company has two warehouses, A and B, and two retail outlets, P and Q. The warehouses supply
goods for the outlets for everyday sales.
A and B can store 12 units and 8 units of goods respectively. Both outlets P and Q sell 9 units of goods
everyday.
The unit delivery cost of goods from A to P is twice that from A to Q, the unit delivery cost from B to
P is 1.2 times that from B to Q, and the unit delivery cost from B to P is 1.5 times that from A to Q.
For every single delivery, the amount of goods delivered should be an integral number of units.
(a) Suppose the unit delivery cost from B to Q is c. Express the unit delivery costs from A to P and
Q as well as from B to P in terms of c.
(b) Let x and y be the units of goods delivered from A to P and from A to Q respectively. Write down
all the constraints on x and y.
(c) Hence devise a strategy for the delivery of goods so that the total delivery cost is a minimum.
(d) Suppose the unit delivery cost from B to P is k times that from B to Q, where k  1.2, with other
conditions remain unchanged. Show that the strategy in (c) remains unchanged for k  1.5.
一間公司擁有 A 和 B 兩個倉庫，及 P 和 Q 兩所零售店。倉庫為零售店提供每天出售的貨品。
A 和 B 分別可存放 12 單位和 8 單位的貨品。零售店 P 和 Q 每天各售出 9 單位的貨品。
從 A 運送每單位貨品到 P 的運費是從 A 送貨到 Q 的兩倍，從 B 運送每單位貨品到 P 的運費是
從 B 送貨到 Q 的 1.2 倍，而從 B 運送每單位貨品到 P 的運費是從 A 送貨到 Q 的 1.5 倍。每次
送貨，送貨單位須為整數。
(a) 設從 B 運送每單位貨品到 Q 的運費是 c，試以 c 表示從 A 送貨到 P 和 Q 及從 B 送貨到
P 的運費。
(b) 設 x 和 y 分別為從 A 送到 P 和從 A 送到 Q 的貨品單位。寫出所有關於 x 和 y 的約束
條件。
(c) 由此訂立出送貨編制，使總運費可以減到最低。
(d) 設從 B 運送每單位貨品到 P 的運費是從 B 送貨到 Q 的 k 倍，其中 k  1.2，其他的條件則
維持不變。證明若 k  1.5，(c) 所訂立的送貨編制將維持不變。
(a) Unit delivery cost from B to P
= 1.2c
Unit delivery cost from A to Q

1 .2 c
=
1 .5
= 0.8c
Unit delivery cost from A to P
= 2(0.8c)
= 1.6c
(b) Let warehouse A delivers x units of goods to P and y units of goods to Q.

Therefore, warehouse B delivers (9 – x) units of goods to P and (9 – y) units of goods to Q.
111
Question Bank
 x  y  12

(9  x)  (9  y )  8
x  9
y  9

 x and y are non - negativeintegers.
 x  y  12

 x  y  10
x  9
y  9

(c) Total delivery cost

= 1.6cx + 0.8cy + 1.2c(9 – x) + c(9 – y)
= (0.4x – 0.2y + 19.8)c
Draw and shade the region that satisfies the constraints and draw the line 2x – y = 0.
From the graph, the delivery cost attains its minimum at (1, 9).
Warehouse A should deliver 1 unit of goods to P and 9 units of goods to Q; warehouse B should deliver 8 units of
goods to P.
(d) Unit delivery cost from B to P = kc

kc 2kc
Unit delivery cost from A to Q = =
1 .5 3
 2 kc  4kc
Unit delivery cost from A to P = 2 =
 3  3
Total delivery cost
 4kc   2kc 
=  x    y  kc9  x   c9  y 
 3   3 
k  2k  
=  x  1 y  9k  9 c
 3  3  
112
k  2k 
The line L: x  1 y  0 should be drawn to find the minimum cost.
3  3 
k
 
Slope of L =   
3
2k
1
3
k
= 2 when 1.2  k  1.5
3  2k
When k = 1.5, the equation of line L becomes x = 0.
In both cases, the delivery cost attains its minimum at (1, 9).
∴ The strategy in (c) remains unchanged for 1.2  k  1.5 .
5. An oil refinery refines both heavy crude oil and light crude oil into petroleum products. The table
below shows the distribution of the natural yield of gasoline, kerosene and lubrication oil in heavy and
light crude oil.
gasoline kerosene lubrication oil

heavy crude 10% 17.5% 20%
light crude 20% 10% 16%
(Note: The percentages do not add to 100% because there are other products in the refining process
not listed above.)
The costs of heavy and light crude oil per barrel are $45 and $38 respectively (1 barrel is 115.6 litres).
Suppose the refinery has to deliver 100 000 barrels of gasoline, 65 000 barrels of kerosene and
250 000 barrels of lubrication oil.
Let x and y be the numbers of units (100 000 barrels) of heavy and light crude oil bought for the
refinery.
(a) Find the cost incurred in the refinery in terms of x and y.
(b) Write down all the constraints on x and y.
(c) Hence find the least total cost on crude oil that meets the production need.
一間煉油廠分別提煉重原油和輕原油成為石油製品。下表所示為重原油和輕原油能夠提煉的汽
油、煤油和潤滑油分量。
汽油煤油潤滑油
重原油 10% 17.5% 20%
輕原油 20% 10% 16%
（附註：因為尚有其他石油製品沒有列出，所以上表百分數的總和並非 100%。）
每桶重原油和輕原油的成本分別為 $45 和 $38。
（1 桶即 115.6 升。）
設煉油廠需提煉 100 000 桶汽油、65 000 桶煤油和 250 000 桶潤滑油。
設 x 和 y 分別為重原油和輕原油購入的單位（每單位 100 000 桶）
。
(a) 以 x 和 y 表示煉油廠的成本。
(b) 寫出所有關於 x 和 y 的約束條件。
113
Question Bank
(c) 由此，求達到預期產量的最低原油成本。
(a) Cost = $100 000(45x + 38y)
(b) Gasoline produced = (0.1x + 0.2y) units

Kerosene produced = (0.175x + 0.1y) units
Lubrication oil produced = (0.2x + 0.16y) units

0.1x  0.2 y  1

0.175x  0.1 y  0.65

0.2 x  0.16 y  2.5
 x, y  0

 x  2 y  10

7 x  4 y  26

10x  8 y  125
 x, y  0
(c) Draw and shade the region that satisfies the constraints and draw the line 45x + 38y = 0.
From the graph, the cost attains its minimum at (12.5, 0). The refinery meets the production need by purchasing 1 250
000 barrels of heavy oil.

∴ The least total cost
= $100 000(45 × 12.5 + 0)
= $56 250 000 (or 56.25 million dollars)
114
6. An objective function z = cx + dy is maximized subject to the following constraints:

根據下列的約束條件，使一個目標函數 z = cx + dy 達到其極大值。
4 y  24
x  y  8


4 x  2 y  24
 x, y  0
The feasible region is shown in the following figure.

下圖所示為可行解。
At which points do the value of z attains its maximum if

在下列情況中，z 的值在哪點達到其極大值？
(a) both c and d are positive and
c 和 d 都是正數及
c
(i)  2?
d
c
(ii)  2?
d
c
(iii) 1   2?
d
c
(iv) 1?
d
c
(v) 0  1?
d
(b) (i) c = 0, d > 0?

(ii) c > 0, d = 0?
(iii) c > 0, d < 0?
115
Question Bank
(iv) c < 0, d > 0?

(v) c < 0, d < 0?
(a) (i) S
(ii) The line RS
(iii) R
(iv) The line QR
(v) Q
(b) (i) The line PQ
(ii) S
(iii) S
(iv) P
(v) O
7. A furniture company produces two types of chairs, A and B. Every chair has to be assembled, finished
and painted. The man-hours required for each process and the man-hours available for each process
per month are given in the table.
A B man-hours available per month

assembling 5 4 1900
finishing 1 1 500
painting 4 3 1500
The profit of making and selling each chair A is $100, and that of chair B is $60. Assume that all
chairs produced can be sold.
(a) Let x and y be the numbers of chair A and B produced. Write down the objective function to be
optimized and the constraints on the objective function so that the profit is a maximum.
(b) Hence, find the values of x and y so that the company can get the maximum possible profit.
一間家具公司生產 A 和 B 兩種椅子。每張椅子均需要裝嵌、拋光和油漆。下表所示為每個工序
所需的工時及每月每個工序可用的工時。
A B 每月可用工時
裝嵌 5 4 1900
拋光 1 1 500
油漆 4 3 1500
製造並售出每張椅子 A 和椅子 B 的利潤分別是 $100 和 $60。假設所有製成的椅子皆可售出。

(a) 設 x 和 y 為椅子 A 和椅子 B 的生產數量。寫出需優化的目標函數及相關的約束條
件，以獲得最大利潤。
(b) 由此，求 x 和 y 的值，讓該公司獲得最大利潤。
(a) The objective function to be optimized is the profit of making and selling chairs.
116
Profit
= $(100x + 60y)

5 x  4 y  1900

 x  y  500

4 x  3 y  1500
 x, y are non - negativeintegers.
(b) Draw and shade the region that satisfies the constraints and draw the line 100x + 60y = 0.
∴ x = 375, y = 0
8. A paper company produces two types (type I and type II) of paper, type I has a width of 2 m, type II
has a width of 2.5 m. It received an order of three models of paper with the following criteria:
Model paper width (m) paper length (m)

S 0.9 30 000
M 1.1 20 000
L 1.3 10 000
In order to satisfy the need of the customer, paper of different widths can be cut from type I and type
II paper. For example, two rolls of paper of width 0.9 m may be cut from a roll of type I paper, with
wastage of paper of width 0.2 m. Obviously, the paper company will not leave any wastage of paper
of width 0.9 m or more.
(a) For the type I paper, there are three possible cutting methods. The first method cuts two rolls of
paper of width 0.9 m, with wastage of paper of width 0.2 m. Complete the table to indicate the
117
Question Bank
other two cutting methods.
Cutting Cutting Cutting

method 1 method 2 method 3
no. of rolls of S 2 1 0
no. of rolls of M 0 0
no. of rolls of L 0
Wastage (m) 0.2 0 0.7
(b) For type II paper, there are five corresponding cutting methods. Complete the table.
Cutting Cutting Cutting Cutting Cutting

method 4 method 5 method 6 method 7 method 8
no. of rolls of S 2 0
no. of rolls of M 0 2 1
no. of rolls of L 0
Wastage (m) 0.7 0.3 0.5 0.3
The paper company wants to minimize the area of wasted papers subject to the criteria set by the
customer. Paper of widths 0.9 m, 1.1 m and 1.3 m produced that exceeds the demand of the
customer is not considered as wastage.
(c) Let x11, x12, x13 be the lengths (m) of paper cut from type I paper according to cutting methods 1,
2 and 3 respectively. Let x24, x25, x26, x27, x28 be the lengths (m) of paper cut from type II paper
according to cutting methods 4, 5, 6, 7 and 8 respectively. Write down the objective function to
be optimized and the constraints on the objective function.
一間造紙公司生產兩種紙張，分別為 I 類和 II 類；I 類的闊度為 2 m，II 類的闊度則為 2.5 m。
該公司接獲一張生產三種尺寸的紙張的訂單，其要求如下：
紙張類別紙張闊度 (m) 紙張長度 (m)

S 0.9 30 000
M 1.1 20 000
L 1.3 10 000
為符合顧客的要求，公司可從 I 類和 II 類紙張剪裁不同闊度的紙張。例如兩卷闊度為 0.9 m 的

紙張可以從一卷 I 類紙張裁剪出來，但會浪費闊 0.2 m 的紙張。在這些條件下，公司不可能浪
費闊 0.9 m 或以上的紙張。
(a) I 類紙張有三種裁剪方法。第一個方法是裁出兩卷闊度為 0.9 m 的紙張，損耗闊 0.2 m 的
紙張。試完成下表以說明另外兩種的裁剪方法。
裁剪方法 1 裁剪方法 2 裁剪方法 3
S 的卷數 2 1 0
M 的卷數 0 0
118
L 的卷數 0
損耗 (m) 0.2 0 0.7
(b) II 類紙張則有五種裁剪方法。試完成下表。
裁剪方法 4 裁剪方法 5 裁剪方法 6 裁剪方法 7 裁剪方法 8
S 的卷數 2 0
M 的卷數 0 2 1
L 的卷數 0
損耗 (m) 0.7 0.3 0.5 0.3
造紙公司要在符合顧客需求的情況下，把紙張損耗減至最低。另外，闊度為 0.9 m、1.1 m 和

1.3 m 的紙張的產量若多於客戶的需求，多餘的部分亦不當作損耗。
(c) 設 x11、x12、x13 分別為利用裁剪方法 1、2 和 3 從 I 類紙張裁剪出來的紙張長度 (m)。
設 x24、x25、x26、x27 和 x28 分別為利用裁剪方法 4、5、6、7 和 8 從 II 類紙張裁剪出
來的紙張長度 (m)。寫出需優化的目標函數及相關的約束條件。
(a)
Cutting Cutting Cutting
method 1 method 2 method 3
no. of rolls of S 2 1 0
no. of rolls of M 0 1 0
no. of rolls of L 0 0 1
Wastage (m) 0.2 0 0.7
(b)
Cutting Cutting Cutting Cutting Cutting
M4 M5 M6 M7 M8
no. of
2 0 0 1 1
rolls of S
no. of
0 2 1 1 0
rolls of M
no. of
0 0 1 0 1
rolls of L
Wastage
0.7 0.3 0.1 0.5 0.3
(m)
(c) The objective function to be optimized is the area of wasted papers.

Area of wasted papers
= 0.2 x11  0.7 x13  0.7 x 24  0.3x 25  0.1x 26  0.5x 27  0.3x 28

2 x11  x12  2 x 24  x 27  x 28  30 000

 x12  2 x 25  x 26  x 27  20 000

 x13  x 26  x 28  10 000
 x11, x12 , x13 , x 24 , x 25 , x 26 , x 27 , x 28  0
119
Question Bank
Multiple Choice Questions

多項選擇題
7y – 35 = –5x
1.
5x + 7y = 35
Take (1, 2) as the test point.
Evaluating 5x + 7y at (1, 2),
5(1) + 7(2) = 19  35
Hence the system of inequalities is
x  1

y  2 .
5 x  7 y  35

Which of the following systems of

2. Which of the following regions represents the
inequalities has the solutions that can be
x  y  4
represented by the shaded region? 
solutions of 3 x  y  0 ?
圖中的陰影區域代表下列哪一個不等式組 x  y  2

的解？
x  y  4
x  2 圖中的哪一個區域代表 3 x  y  0 的

A. y 1 x  y  2
7 x  5 y  35 

解？
x  1

B. y  2
5 x  7 y  35

x  1

C. y  2
7 x  5 y  35

x  2

D. y 1
5 x  7 y  35

B
Slope of the straight line passing through (7, 0) and

A. Region I
(0, 5)
B. Region II
50
=
07 C. Region III
5 D. Region IV
= 
7
A
The equation of the straight line passing through (7, 0)
and (0, 5) is
5 Evaluating x + y at (0, 2),
y–5=  (x – 0)
7 (0) + (2) = 2  4
120
Evaluating 3x – y at (0, 2), 4. Among the points in the figure, at which

3(0) – (2) = –2  0 point does p = 3x + y attain its maximum
Evaluating x – y at (0, 2), value?
(0) – (2) = –2  2 在圖中的各點之中，p = 3x + y 在哪一點取
∴ Region I is the region that represents the solutions. 得其極大值？
3.
A. (7, 1)
Which of the following systems of B. (5, 4)
inequalities has the solutions that can be C. (3, 4)
represented by the shaded region? D. (1, 3)
圖中的陰影區域代表下列哪一個不等式組 A
的解？ Draw the line 3x + y = 0.
2 x  3 y  0
A. 
3x  2 y  0
2 x  3 y  0
B. 
3x  2 y  0
2 x  3 y  0
C. 
3x  2 y  0
2 x  3 y  0
D. 
3x  2 y  0 From the graph, the value of p attains its maximum at
B (7, 1).
Take (0, –2) as the test point.
Evaluating 2x – 3y at (0, –2), 5. Find the maximum value of p = 2x + y subject

2(0) – 3(–2) = 6  0 x  0
y  0
to the constraints 
Evaluating 3x + 2y at (0, –2),
.
3(0) + 2(–2) = –4 < 0  x  2 y  10
 x  y  6
2 x  3 y  0
∴ The solutions of  can be represented
3x  2 y  0
by the shaded region.
121
Question Bank
x  0
y  0

根據約束條件  ，求 p = 2x + y
 x  2 y  10
 x  y  6
的極大值。
A. A(1, 1)
B. B(2, 3)
C. C(5, 4)
D. D(6, 2)
C
Draw the line 2x + 3y – 5 = 0.
A. 6
B. 8
C. 12
D. 16
C
Draw the line 2x + y = 0.

From the graph, the value of 2x + 3y – 5 = 0 attains its
maximum at C(5, 4).
7. Find the minimum and maximum values of

 2  x  4
x – 2y subject to the constraints  .
 1  y  4
 2  x  4
根據約束條件  ，求 x – 2y 的極
 1  y  4
小值和極大值。
From the graph, the value of p attains its maximum at
(6, 0).
∴ Maximum value of p = 2(6) + 0 = 12
6. In the figure, at which point in the shaded

region will the value of 2x + 3y – 5 be the
greatest?
問 2x + 3y – 5 在圖中陰影區域內哪一點取
得其極大值？ A. –4, 1
122
B. –2, 4 of the x-axis for decreasing value of C, and C attains its
C. –3, 8 minimum at point S.
D. –10, 6
D 9. In the figure, find the minimum value of
Draw the line x – 2y = 0. c = x + y subject to the following constraints:
4 x  3 y  12

x  2 y  6
 x and y are positive integers.

在圖中，根據下列的約束條件，求
c = x + y 的極小值。
4 x  3 y  12

x  2 y  6
 x 和 y 都是正整數 

From the graph, the value of x – 2y attains its minimum
and maximum at (–2, 4) and (4, –1) respectively.

∴ Minimum value of x – 2y = –2 – 2(4) = –10
Maximum value of x – 2y = 4 – 2(–1) = 6
8. In the figure, which point in the shaded

region does C = 2x + 2y attain its minimum
value?
設 C = 2x + 2y。問 C 在圖中陰影區域內哪
一點取得其極小值？ A. 3
B. 3.6
C. 4
D. 6
D
The feasible solutions are the points in the shaded
region with integral x- and y- coordinates.
Draw the line x + y = 0.
A. Point P
B. Point Q
C. Point R
D. Point S
D
Translate the line 2x + 2y = 0 in the negative direction
123
Question Bank
From the graph, the value of c attains its minimum at
(0, 4), (1, 3) and (2, 2).

∴ Minimum value of c = x + y = 4
10. In the figure, if (x, y) is a point in the shaded

region, which of the following constraints on
x and y are true?
在圖中，若 (x, y) 是陰影區域內的一點，
以下何者為正確？
I. y6
II. 2x  y  0
III. 2 x  y  6
A. I and II only
B. I and III only
C. II and III only
D. I, II and III
B
I is true.
Evaluating 2x – y at (1, 5),
2(1) – (5) = –3  0
∴ 2x – y  0 is not a constraint.
II is wrong.
Evaluating 2x + y at (1, 5),
2(1) + (5) = 7  6
∴ 2x + y  6 is a constraint.
III is true.
∴ Only I and III are true..
124

Linear Inequalities in Two Unknowns (A)

Uploaded by

Copyright:

Available Formats

Linear Inequalities in Two Unknowns (A)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Linear Inequalities in Two Unknowns (A)

Uploaded by

Copyright:

Available Formats

Linear Inequalities in Two Unknowns

1. Solve the following compound inequalities graphically.

∴ The solution is:

Since there is no common region, there are no solutions.

2x < 14 and 3x > 12

x<7 and x>4

5 Solve the inequality x + 4y  4 graphically.

6. Solve the inequality x – 2y < 4 graphically.

(b) Draw the line 2x + y = 0.

(b) Draw the line 4x + 2y = 0.

(ii) x and y are integers.

(c) Profit P = $(175x + 200y)

Healthy food Vitamin C Vitamin E

健康食品 維他命 C 維他命 E

已知每 g 健康食品 P 和 Q 的成本分別為 $8 和 $10。為滿足上述維他命的攝取量，假設該病人每人

(c) Cost = $(8x + 10y)

Perimeter of ΔABC = (x + 1) + (3x – 3) + (2x – 2)

已知倉庫 P 和 Q 的電視機存貨量分別為 35 部和 15 部。假設從倉庫 P 分別運送了 x 部和 y 部電視機

(b) 在一個直角坐標平面上，標示滿足在 (a) 中所得的約束條件的區域。

(b) (i) Draw the line x + 2y + 3 = 0.

From the graph, P attains its maximum at

1. Set up an inequality in x for each of the following diagrams.

2 Solve x + 3 > 4, and represent the solution graphically.

3. Set up an inequality in x for each of the following diagrams.

4. Solve –3x + 4 < 7, and represent the solution graphically.

5. Solve x – 3  2, and represent the solution graphically.

6. Solve 2x + 15  0, and represent the solution graphically.

7. Solve 6 – 2x < 1, and represent the solution graphically.

10. Solve 4x – 8  –1, and represent the solution graphically.

11. Set up an inequality in x for each of the following diagrams.

12. Solve 3x – 20  –7, and represent the solution graphically.

13. Solve 7x + 12  –2 , and represent the solution graphically.

15. Solve –4x + 7 < 0, and represent the solution graphically.

17. Solve 4x – 2  –8, and represent the solution graphically.

18. Solve 7 – 2x  5, and represent the solution graphically.

2. Solve x – 3  –1 and 2x – 9  1, and represent the solution graphically.

9. Solve –2 < 2x – 3  2, and represent the solution graphically.

15. Shade the half-plane which satisfies the given inequality.

15. Shade the half-plane which satisfies the given inequality.

16. Shade the half-plane which satisfies the given inequality.

17. Shade the half-plane which satisfies the given inequality.

22. Solve the following system of inequalities graphically.

23. Solve the following system of inequalities graphically.

24. Solve the following system of inequalities graphically.

25. Solve the following system of inequalities graphically.

26. Solve the following system of inequalities graphically.

27. Solve the following system of inequalities graphically.

28. Solve the following system of inequalities graphically.

29. Solve the following system of inequalities graphically.

30. Solve the following system of inequalities graphically.

31. Solve the following system of inequalities graphically.

32. Solve the following system of inequalities graphically.

33. The shaded region represents the solutions of a system of inequalities.

(a) Find the maximum value of P  2 x  3 y  2 .

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

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

(a) Find the maximum value of P  2 x  4 y .

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

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

健康食品維他命 C 維他命 E