CHAPTER 10 LINEAR PROGRAMMING FORM 5
PAPER 2
1. Amirah has an allocation of RM200 to buy x workbooks and y reference books. The total
number of books is not less than 20. The number of workbooks is at most twice the number of
the references. The price of a workbook is RM10 and that of a reference is RM5.
a ) Write down three inequalities, other than x 0 and y 0, which satisfy all the above
constraints.
( 3 marks)
b ) Hence, using a scale of 2cm to 5 books on the x-axis and 2cm to 5 books on the y-axis,
construct and shade the region R that satisfies all the above constraints. ( 4 marks )
c ) If Amirah buys 15 reference books, find the maximum amount of money that is left.
( 3 marks )
2. A university wants to organise a course for x medical undergraduates and y dentistry
undergraduates. The method in which the number of medical undergraduates and dentistry
undergraduates are chosen are as follows.
I : The total number of participants is at least 30.
II : The number of medical undergraduates is not more than three times the number of dentistry
undergraduates.
III : The maximum allocation for the course is RM6 000 with RM100 for a medical
undergraduates and RM80 for a dentistry undergraduates.
a) Write down three inequalities, other than x 0 and y 0, which satisfy all the above
constraints.
( 3 marks )
b) Hence, by using a scale of 2cm to 10 participants on both axes, construct and shade the region
R that satisfies all the above constraints. ( 3 marks )
c) Using your graph from (b), find
( i) The maximum and minimum number of dentistry undergraduates , if the number of
medical undergraduates that participate in the course is 20.
(ii) The minimum expenditure to run the course in this case. ( 4 marks )
3. A tuition centre offers two different subjects, science, S, and mathematics, M, for Form 4
students. The number of students for S is x and for M is y. The intake of the students is based on
the following constraints.
I : The total number of students is not more than 90.
II : The number of students for subject S is at most twice the number of students for subject
M.
III : The number of students for subject M must exceed the number of students for subject S
by at most 10
143
CHAPTER 10 LINEAR PROGRAMMING FORM 5
a) Write down three inequalities, other than x 0 and y 0, which satisfy all the above
conditions.
( 3 marks)
b) Hence, by using a scale of 2 cm to represent 10 students on both axes, construct and shade the
region R that satisfies all the above conditions. ( 3 marks )
c) Using the graph from ( b ), find ( 4 marks )
( i ) the range of the number of students for subject M if the number of students for subjects S
is 20
(ii) the maximum total fees per month that can be collected if the fees per month for subject S
and M are RM12 and RM10 respectively.
4 A bakery shop produces two types of bread, L and M. The production of the bread involves two
processes, mixing the ingredients and baking the breads. Table 1 shows the time taken to make
bread L and M respectively.
Type of bread Time taken ( minutes )
Mixing the ingredients Baking the breads
L 30 40
M 30 30
Table 1
The shop produces x breads of type L and y breads of type M per day. The production of breads
per day are based on the following constraints:
I : The maximum total time used for mixing ingredients for both breads is not more than 540
minutes.
II : The total time for baking both breads is at least 480 minutes.
III : The ratio of the number of breads for type L to the number of breads for type M is not less
than 1 : 2
a ) Write down three inequalities, other than x 0 and y 0, which satisfy all the above
constraints. ( 3 marks )
b) Using a scale of 2 cm to represent 2 breads on both axes, construct and shade the region R
that satisfies all the above constraints. ( 3 marks )
c) By using your graph from 4(b), find
( i ) the maximum number of bread L if 10 breads of type M breads are produced per day.
(ii ) the minimum total profit per day if the profit from one bread of type L is RM2.00 and
144
CHAPTER 10 LINEAR PROGRAMMING FORM 5
from one bread of type M is RM1.00 . ( 4 marks )
5. A factory produced x toys of model A and y toys of model B. The profit from the sales of a
number of model A is RM 15 per unit and a number of model B is RM 12 per unit.
The production of the models per day is based on the following conditions:-
I : The total number of models produced is not more than 500.
II : The number of model A produced is at most three times the number of model B.
III : The minimum total profit for model A and model B is RM4200.
a) Write down three inequalities, other than x 0 and y 0, which satisfy all the above
conditions.
( 3 marks)
b) Hence, by using a scale of 2 cm to represent 50 models on both axes, construct and shade the
region R that satisfies all the above conditions. ( 3 marks )
c) Based on ypur graph, find ( 4 marks )
( i ) the minimum number of model B if the number of model A produced on a particular
day is 100.
(ii) the maximum total profit per day
145
CHAPTER 10 LINEAR PROGRAMMING FORM 5
1. ( a ) I : x + y 20 1
II : x 2y 1
III : 10 x + 5y 200 1
2x + y 40
(b) 4
40
35
30
25
20
2x + y = 40
R y = 15
15
10 x + y = 20
x = 2y
10 20 30 40 50 60
( c ) Draw the line y = 15 1
From the graph, the minimum value occurs at ( 5, 15 ) 1
Hence, minimum expenditure = 10 (5) + 5 (15)
= RM125
Therefore, the maximum amount of money left = RM200 RM125
=RM 75 1
146
CHAPTER 10 LINEAR PROGRAMMING FORM 5
2.
( a ) I : x + y 30 1
II : x 3y 1
III : 100 x + 80y 6000 1
5x + 4y 300
(b) 3
90
80
5x + 4y = 300
70
x = 20
60
50
40
R
30
20
x = 3y
x + y =30
10
-20 20 40 60 80 100 120 140
-10
( c ) ( i ) Draw the line x = 20, 1
From the graph, the minimum number of dentistry undergraduates is 10 and the 1
maximum number of dentistry undergraduates is 50.
(ii) For the minumum expenditure, there are 20 medical undergraduates and 10 dentistry
undergraduates.
Thus , minimum expenditure = 100 (20) + 80(10) 1
=RM2800 1
147
CHAPTER 10 LINEAR PROGRAMMING FORM 5
3
. ( a ) I : x + y 90 1
II : x 2y 1
III : y - x 10 1
(b) 3
90
80
x + y = 90
70
60
y - x = 10
50
40
R
x = 2y
30
20
12x + 10y = 600
10
20 40 60 80 100 120 140
-10
( c ) ( i ) From the graph, when x = 20, the range of y is 10 y 30
1
( ii ) The maximum value occurs at ( 60, 30)
1
Thus, maximum total fee = 12 (60) +10 (30)
= RM1 020 1
1
148
CHAPTER 10 LINEAR PROGRAMMING FORM 5
4
( a ) I : 3x + 3y 54 1
II : 4x + 3y 48 1
III : 2x y 1
(b) 3
22
20
18
16
y = 2x
14
12
10
3x + 3y =54
6
R
4 4x + 3y = 4 8
5 10 15 20 25 30 35
2x + y = 2
-2
1
( c ) (i ) 8 2
(ii ) (5 x RM2.00) + ( 10 x RM1.00) 1
= RM 20.00
149
CHAPTER 10 LINEAR PROGRAMMING FORM 5
5 (a ) I : x + y 500 1
II : x 3y 1
III : 15x + 12y 4200 1
5x + 4y 1400
(b)
( c ) ( i ) When x = 100, the minimum number of model B is 225.
1
(ii ) Maximum point (375, 125)
The maximum total profit per day
= 15(375) +12(125)
= RM7125
1
1
150
