0% found this document useful (0 votes)
21 views4 pages

(A) Quiz Linear Programming

Uploaded by

qh46wnzbgm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views4 pages

(A) Quiz Linear Programming

Uploaded by

qh46wnzbgm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

QUIZ LINEAR PROGRAMMING

NAME: ________________________________________________________ CLASS : ___________

1. A Sarawak layer cake entrepreneur sells two types of premium layer cakes, namely layer cake A
and layer cake B. The profit from the sale of x pieces of layer cake A is RM30 and y pieces of
layer cake B is RM20. The sale of these layered cake on a day is based on the following
constraints.

I : The total number of layer cake sold is at most 450 pieces.


II : The number of layer cake A is not more that twice the number of layer cake B.

III : The minimum profit for both types of layer cake is RM6000.

a) Write 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 50 pieces of cake on both axes, construct and shade the region R which
satisfies all the above constraints.
[3 marks]

c) By using the graph constructed in (b), find

i. the minimum number of layer B cakes if the number of layer A cakes sold on a given day
is 50 pieces.
ii. the maximum profit in a day.

[4 marks]
ANSWER:

(c) (i) y =225 pieces 1 4

(ii) k  30 x  20 y (no multiple answer / cannot simplify) 1

k  30(300)  20(150) - substitute (300,150) into k  30 x  20 y 1

k  RM 12000 1
2. Encik Wilson plants x banana trees and y coconut trees in his orchard. The planting budget is
based on the following constraints:

I : The total number of trees cannot exceed 60.


II : The number of banana tree not more than two times the number of coconut tree.
III : The number of coconut tree exceeds the number of banana tree at most 40.

a) Write 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 10 trees on both axes, construct and shade the region R which
satisfies all the above constraints.
[3 marks]

c) By using the graph constructed in (b), find

i. the maximum number of banana trees that can be planted if 45 coconut trees are planted,
ii. the maximum total cost for the trees if the cost of banana seedlings is RM3 and the cost
of coconut seedlings is RM6.

[4 marks]

ANSWER:

(c) (i) maximum value of x=15 1

(ii) k  3 x  6 y (no multiple answer / cannot simplify) 1

k  3(10)  6(50) - substitute (10,50) into k  3 x  6 y 1

k  RM 330 1
1
1
1

You might also like