S5 Mathematics S519 01HW Linear Programming_sol 1/6
Chapter 19 Linear Programming
Name: ( ) Class: ( ) Marks:
1. The working hours and materials needed to produce a toy car and a toy plane are given as:
Toy car Toy plane
Working hours 3 2
Materials 4 units 3 units
There are a total of 90 working hours and 120 units of materials. The number of toy planes should not
be more than twice that of the toy cars.
The profits of selling a toy car and a toy plane are $20 and $30 respectively. Let x be the number of toy
cars made and y be the number of toy planes made.
(a) Set up the system of the constraints in terms of x and y.
(b) Set up an objective function of the profit $P.
3x + 2 y 90
4 x + 3 y 120
(a)
y 2x
x and y are non-negative integers
(b) P( x, y) = 20 x + 30 y
2. A shop has 28 kg of grade I tea and 42 kg of grade II tea. The shop produces two types of mixture, A and
B by mixing grade I and grade II teas in the ratios 1 : 3 and 3 : 2 respectively.
Let x kg be the weight of mixture A produced and y kg be that of mixture B. The profits of selling mixtures
A and B are $150/kg and $300/kg respectively.
(a) Set up the system of the constraints in terms of x and y.
(b) Set up an objective function of the profit $P.
1 3
4 x + 5 y 28
3 2
(a) x + y 42
4 5
x, y 0
(b) P( x, y) = 150 x + 300 y
S5 Mathematics S519 01HW Linear Programming_sol 2/6
3. A dietician mixes x kg of food P and y kg of food Q together to make a health food. The table below shows the
nutrient contents of 1 kg of food P and 1 kg of food Q:
Protein Vitamin Carbohydrate
Food P 100 units 150 units 500 units
Food Q 300 units 150 units 300 units
The health food contains at least 1 000 units of protein, 1 200 units of vitamin and 3 000 units of carbohydrate. It
is known that food P and food Q cost $60/kg and $40/kg respectively.
(a) Write down the constraints for x and y.
(b) Draw and shade the feasible region satisfying all constraints in (a) on a piece of graph paper.
(c) Find the minimum cost for the dietician to make the health food.
(10 marks)
x 0
y 0
(a) The constraints are 100x + 300 y 1 000 . 1A+1A+1A
150x + 150 y 1 200
500x + 300 y 3 000
(b)
1A for drawing the straight line
100x + 300y = 1 000
1A for drawing the straight line
150x + 150y = 1 200
1A for drawing the straight line
500x + 300y = 3 000
1A for the shaded region
(c) Let the cost be $C. Then C = 60x + 40y. 1A
By method of the sliding line, draw a straight line 60x + 40y = k on the figure, where k is a constant.1M
From the graph, C attains its minimum value at (3 , 5).
By method of testing vertices:
C (0,10) = 60(0) + 40(10) = 400
C (3,5) = 60(3) + 40(5) = 380
C (7,1) = 60(7) + 40(1) = 460
C (10,0) = 60(10) + 40(0) = 600 1M
Corresponding minimum value = 60(3) + 40(5) = 380
The minimum cost for the dietician to make the health food is $380. 1A
S5 Mathematics S519 01HW Linear Programming_sol 3/6
4. (a) The figure below shows two straight lines L1 and L2. L1 cuts the coordinate axes at two points (5k , 0)
and (0 , 8k), while L2 cuts the coordinate axes at two points (9k , 0) and (0 , 5k), where k is a positive
integer. Find the equations of the straight lines L1 and L2 in terms of k.
(b) A snack shop plans to launch two types of assorted cookies A and B. The numbers of different kinds
of cookies in a box of each type of assorted cookies are as follows:
Chocolate cookies Peanut cookies
Type A 24 10
Type B 15 18
The numbers of chocolate cookies and peanut cookies that the snack shop has are 240 and 180
respectively. Suppose these cookies are used to produce x boxes of type A assorted cookies and y
boxes of type B assorted cookies. The profit made from selling a box of type A assorted cookies is
$50 and that made from selling a box of type B assorted cookies is $40.
(i) Write down the constraints for x and y.
(ii) Using the figure in (a) and putting k = 2, find the maximum profit made by the snack shop in
selling these boxes of type A and type B assorted cookies.
(11 marks)
(a) The equation of the straight line L1 is
y − 8k 8k − 0
= 1M
x−0 0 − 5k
y − 8k 8
=−
x 5
8x + 5y – 40k = 0 1A
S5 Mathematics S519 01HW Linear Programming_sol 4/6
The equation of the straight line L2 is
y − 5k 5k − 0
= 1M
x−0 0 − 9k
y − 5k 5
=−
x 9
5x + 9y – 45k = 0 1A
24 x + 15 y 240
(b) (i) The constraints are 10 x + 18 y 180 . 1A+1A+1A
x and y are non-negative integers
(ii) Simplifying the constraints obtained in (b)(i), we have
8 x + 5 y 80
5 x + 9 y 90
x and y are non-negative integers
Take k = 2. Then the graph in (a) becomes:
1M for drawing the straight line
50x + 40y = c, where c is a constant
The black dots in the figure indicate all the feasible solutions of the constraints obtained in (b)(i). 1A
Let the profit be $P. Then P = 50x + 40y. 1A
By method of the sliding line,
draw a straight line 50x + 40y = k on the figure, where k is a constant. 1M
It is found that P attains it’s maximum at ( 6, 6 ) or ( 0, 0 ).
P(0,0) = 50(0) + 40(0) =0
P(6, 6) = 50(6) + 40(6) = 540
By method of testing vertices:
P(0,0) = 50(0) + 40(0) =0
P(0,10) = 50(0) + 40(10) = 400
P(5, 7) = 50(5) + 40(7) = 530
P(6, 6) = 50(6) + 40(6) = 540
P(10,0) = 50(10) + 40(0) = 500
Maximum profit = $540 1A
S5 Mathematics S519 01HW Linear Programming_sol 5/6
5. The ingredients of two types of cakes made by a baker are as follows:
Type A Type B
Sugar (g) 120 150
Flour (g) 180 100
Cream (g) 40 90
The baker has 1 500 g of sugar, 2 000 g of flour and 800 g of cream. Suppose the numbers of type A cakes and type
B cakes made are x and y respectively.
(a) Write down the constraints for x and y.
(b) Draw the feasible region of the constraints obtained in (a) on a piece of graph paper.
[Unit length for both axes: 5 divisions (0.5 cm)]
(c) The profits made from selling each type A cake and each type B cake are $80 and $60 respectively. Find the
number of type A cakes and the number of type B cakes that should be made in order to obtain a maximum
profit. What is that maximum profit?
(12 marks)
120x + 150 y 1 500
180x + 100 y 2 000
(a) The constraints are . 1A+1A+1A+1A
40 x + 90 y 800
x and y are non-negative integers
(b) Simplifying the constraints obtained in (a), we have
4 x + 5 y 50
9 x + 5 y 100
.
4 x + 9 y 80
x and y are non-negative integers
1A for drawing the straight line
4x + 5y = 50 (solid)
1A for drawing the straight line
9x + 5y = 100 (solid)
1A for drawing the straight line
4x + 9y = 80 (solid)
The black dots in the figure indicate all the feasible solutions of the constraints obtained in (a). 1A
S5 Mathematics S519 01HW Linear Programming_sol 6/6
(c) Let the profit be $P. Then P = 80x + 60y. 1A
By method of the sliding line,
draw a straight line 80x + 60y = k on the figure, where k is a constant. 1M
It is found that P attains it’s maximum at ( 10, 2 ) or ( 0, 0 ).
P(0,0) = 80(0) + 60(0) =0
P(10, 2) = 80(10) + 60(2) = 920
By method of testing vertices:
P(0, 0) = 80(0) + 60(0) =0
P(2,8) = 80(2) + 60(8) = 620
P(5, 6) = 80(5) + 60(6) = 760
P(10, 2) = 80(10) + 60(2) = 920
P(11, 0) = 80(11) + 60(0) = 880
Maximum value of P = 920
10 type A cakes and 2 type B cakes should be made in order to obtain a maximum profit. 1A
The maximum profit is $920.
