0% found this document useful (0 votes)
333 views19 pages

Skema Pemarkahan Pengaturcaraan Linear SMK Agama Tun Juhar

This document contains 9 multiple choice questions about linear programming. Each question provides 3 constraints that form a linear programming problem. For each problem, candidates are asked to: 1) Draw the feasible region defined by the constraints 2) Find the minimum or maximum value of an objective function within the feasible region 3) State the optimal solution in 1-3 sentences The document provides detailed step-by-step workings for the constraints, graphs, and solutions for each of the 9 problems.

Uploaded by

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

Skema Pemarkahan Pengaturcaraan Linear SMK Agama Tun Juhar

This document contains 9 multiple choice questions about linear programming. Each question provides 3 constraints that form a linear programming problem. For each problem, candidates are asked to: 1) Draw the feasible region defined by the constraints 2) Find the minimum or maximum value of an objective function within the feasible region 3) State the optimal solution in 1-3 sentences The document provides detailed step-by-step workings for the constraints, graphs, and solutions for each of the 9 problems.

Uploaded by

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

MODUL ULANGKAJI MATEMATIK TAMBAHAN SPM PPD

SANDAKAN

(SKEMA JAWAPAN)

TOPIK: PENGATURCARAAN LINEAR

DISEDIAKAN OLEH:

EN. FADLY JOE BIN RAIMIN

SMK AGAMA TUN JUHAR, SANDAKAN


SKEMA JAWAPAN

1
.
N1 I :x+y8
N1 II : x 2y or
(a) y x 3
N1 III : 800x + 300y 4 000 or
8x + 3y 40

(b
3
)

K1
N1
N1
draw correctly at least one straight line
draw correctly three straight lines
shaded region

(c) N1 x = 3, the minimum value of y = 2.


Based on the graph, when
1
(i) The minimum number of vans rented is 2.

1
Let the number of members that can be accommodated be 48.
N1 0
48x + 12y = 48
4x + y = 4
(ii
Based on the graph, the maximum number of members that can be
) 3
accommodated is occured when x = 4 and y = 2.

Maximum number of members


K1K
= 48(4) + 12(2)
1
= 216
N1
2
.
N1 I : x + y 500
N1 II : x 3y or
(a) y x 3
N1 III : 15x + 12y 4 200 or
5x + 4y 1 400

(b
3
)

K1
N1
N1
draw correctly at least one straight line
draw correctly three straight lines
shaded region

(c) Based on the graph, when x = 100, the minimum value of y = 225.
N1 1
(i)
The minimum number of pieces of component Q produced is 225.
N1 Objective function = 15x + 12y 1
0
Based on the graph, the maximum total profit is obtained when x = 375
(ii and y = 125.
3
)
Maximum total profit
K1K1 = 15(375) + 12(125)
N1 = RM7 125
3
.
N1 I : y 2x
(a) N1 3
II : y x
N1 III : 3x + 2y 120

(b
3
)

K1
N1
N1
draw correctly at least one straight line
draw correctly three straight lines
shaded region

(c)
Based on the graph, when x = 30, the minimum value of y = 7.5. 1
(i) N1
The minimum number of tins of gloss paint is 7.5.
Objective function = 50x + 70y 1
0
Let 50x + 70y = 350
N1 5x + 7y = 35
(ii
3
) Based on the graph, the maximum value of 50x + 70y occurs when x = 17
and y = 34.
Maximum expenditure for the paint
K1K1 = 50(17) + 70(34)
N1 = RM3 230
4
.
N1 I : 60x + 20y 720 or
3x + y 36
N1 II : 30x + 40y 360 or
3x + 4y 36
(a) N1 x 1 3
III :
or
y 3
y3 x

(b
3
)

K1
N1
N1
draw correctly at least one straight line
draw correctly three straight lines
shaded region

Based on the graph, when x = 7,


(c) the minimum value of y = 4.
1
(i)
N1 The minimum number of racks of type Q
produced per day is 4.
Objective function = 24x + 32y 1
0
Let the profit be RM192.
24x + 32y = 192
3x + 4y = 24
(ii
3
)
Based on the graph, the maximum profit
is obtained when x = 6 and y = 18.

K1K1 Maximum profit = 24(6) + 32(18)


N1 = RM720
5.
N1 I : 3x + 5y 60
N1 II : 2x + 3y 60
(a) 3
N1 III : x 5
y5

(b) 3

K1
N1
N1
draw correctly at least one straight line
draw correctly three straight lines
shaded region

(c)
1
(i) N1 x = 5, y = 16
Objective function = 40x + 80y 10

Based on the graph, the maximum profit


is obtained when x = 5 and y = 16.
(ii) 3
K1K1 Maximum income = 40(5) + 80(16)
N1 = RM1480
6.
N1 I : x + y 1 000
N1 II : x 2y
(a) 3
N1 III : x + 1.8y 900

(b) 3

K1
N1
N1

draw correctly at least one straight line


draw correctly three straight lines
shaded region

10
Maximum total profit per day, k = x + 1.8y
N1 The maximum total profit occurs when x = 0 and y = 1 000.
(c) 4
Maximum total profit per day
K1K1 = 0 RM1.00 + 1 000 RM1.80
= RM1 800
N1
7
.
N1 I : x 50
N1 II : y 20
N1 III : x + y 80
(a) 4
N1 IV : 40x + 20y 1 800
2x + y 90

(b) 3

K
1
N
1 draw correctly at least one straight line
N draw correctly three straight lines
1 shaded region

(c) The point (50, 30) gives the maximum value of 2x + y.


1
(i) Thus, Penny needs to order 50 hampers of type A and 30 hampers of type
N1
B.
Maximum profit 1
(ii) K1 = RM(40 50 + 20 30) 2 0
N1 = RM2 600
8
.
N1 I : 3x + 5y 4 800
N1 II : y 200
(a) 3
N1 III : 2x + 3y 1 000

(b
3
)

K1
N1
N1
draw correctly at least one straight line
draw correctly three straight lines
shaded region

(c)
1
(i) N1 The maximum number of fish A that can be sold is 1 260.
The maximum total profit is obtained when x = 1 260 and y = 200. 1
(ii Maximum total profit 0
3
) K1K1 = 2(1 260) + 3(200)
N1 = RM3 120
9
.
N1 I : x + y 400
N1 II : x 4y
(a) N1 III : 18x + 15y 2 880 or 3
6x + 5y 960

(b
3
)

K1
N1
N1
draw correctly at least one straight line
draw correctly three straight lines
shaded region
(c)
When x = 110, the minimum value of y = 60. 1
(i) N1
The minimum number of boxes of candle Q produced is 60.
(ii Objective function = 18x + 15y 3 1
) Based on the graph, the point which gives 18x + 15y its maximum value 0
is (320, 80).
Maximum total profit per day
K1K1 = 18(320) + 15(80)
N1 = RM6 960

10
.
N1 I : 3x + 5y 300
N1 II : x + y 80
(a) N1 III : x 20 3
y 10

(b
3
)

K1
N1
N1
draw correctly at least one straight line
draw correctly three straight lines
shaded region
(c)
1
(i) N1 Profit is maximum when x = 50 and y = 30
1
0
Objective function = 8x + 13y

(ii Based on the graph, the maximum profit


3
) is obtained when x = 50 and y = 30.

K1K1 Maximum profit = 8(50) + 13(30)


N1 = RM790
11.
N1 I : 3x + 4y 48
N1 II : x + 3y 24
(a) 3

(b
3
)

K1
N1
N1
draw correctly at least one straight line
draw correctly three straight lines
shaded region
(c)
1
(i) N1 x = 9, y = 5
10
Objective function = 40x + 60y

(ii Based on the graph, the maximum profit


3
) is obtained when x = 9 and y = 5.

K1K1 Maximum income = 40(9) + 60(5)


N1 = RM660
12.
N1 I : 4x + 5y 500
N1 II : 3x + 2y 300
(a) 3
N1 III 3x + 5y 450

(b) 3

K1
N1
N1
draw correctly at least one straight line
draw correctly three straight lines
shaded region
(c)
1
(i) N1 x = 50, y = 60
(ii) 3 10
Objective function = 6x + 8y

Based on the graph, the maximum return


is obtained when x = 6 and y = 8.

K1K1 Maximum returns = 6(50) + 8(60)


N1 = RM780

13
.
N1 x 1 and
y3
(a) 3
N1 2x + y 10
N1 6x + 5y 40

(b
3
)

K1
N1
N1

draw correctly at least one straight line


draw correctly three straight lines
shaded region
(c) 1
(i) N1 x = 1, y = 6.8
1
Objective function = 2000x + 4000y 0

Based on the graph, the maximum return


(ii
is obtained when x = 1 and y = 6.8. 3
)
K1K1 Maximum returns = 2000(1) + 4000(6.8)
N1 = RM29200

14
.
N1 x + y 150
(a) N1 2x + y 210 3
N1 x + 4y 180

(b
3
)

K1
N1
N1

draw correctly at least one straight line


draw correctly three straight lines
shaded region
(c)
1
(i) N1 x = 94, y = 21
1
Objective function =0.02x + 0.015y 0

Based on the graph, the minimum cost


(ii
is obtained when x =94 and y = 21 3
)
K1K1 Minimum cost = 0.02x(94) + 0.015(21)
N1 = RM2.195

15
.
I : 80 x+ 60 y 6000
4 x +3 y 300

II : x+ y 50

(a) 80 3
III:
y x
100
4
y x
5
(b
3
)

K1
N1
N1

draw correctly at least one straight line


draw correctly three straight lines
shaded region

(c)
Based on the graph, when x = 24, 26 y 68. 1
(i)
N1 Hence, the minimum number of chairs made is 26.
Let the profit be RMp. 1
Objective function, p = 40x + 20y 0

Let p = 800.
Draw the line 40x + 20y = 800.
(ii
3
) Based on the graph, p is a maximum when x = 46 and y = 38.
(x and y are positive integers.)

K1K Maximum profit


1
N1

You might also like