MARKING SCHEME

PRA PENTAKSIRAN PENGGAL 3 TAHUN 2013

SMK TUN HUSSEIN ONN, KLUANG, JOHOR.
PRA U ATAS
MATHEMATICS M ( PAPER 3)
NO
SCHEME
1.
a)
[5]

MARKS
M1
A1

= RM 11392.19

2.
[11]

M1M1
A1

b) 300(48) 11392.19
= RM 3007.81
a) C(x) = x(

A1

b) R(x) = xD(x)
= 20x 0.001x2
When R (x) = 0
20 0.002x = 0
X = 10 000
R (x) = -0.002 < 0
Maximum revenue when x = 10 000
R (10 000) = 20 (10 000) 0.001 ( 10 000)2
= RM 100 000.00
c) P(x) = R(x) C(x)
= 20x 0.001x2 1000 5x
= 15x 0.001x2 -1000
P(x) = 0
15 0.002x = 0
x = 7500
P (x) = -0.002 < 0,
Maximum profit when x = 7500
P ( 7500 ) = 15 (7500) 0.001( 7500) 2 -1000
= RM 55250.00

A1
M1
A1

M1
A1

M1

M1
A1

M1
A1

3.
[7]

a)

y
D1(both
Lines with
label)

6
3x +2y = 12

D1-feasibl
e
region

3
x +2y = 6
1
x
2

4.
[7]

x = 3, y = 1.5
maximum value = 3(3) + 3(1.5)
= 13.5

B1(both)
M1
A1

b f = x + 2y // x + 2y = 6 or
multiple optimal solutions

B1
B1

a) Co = 1000,

Ch=0.40

EOQ =

M1
A1

= 707 units

M1
A1

b) cycle time =
= 7.07 weeks or 49.49 days
c) yearly inventory cost =
= RM14707.82

M1
M1
A1

5.
[8]

B
1

0 0
7

D1

2
3

7 7

10 10

D1

D1

10 11
7
3

4
5
15 15
7

6
6
21 21
7

b) possible path
A-F-G
A-C-D-G
A-B-X-D-G
A-B-E-G
Critical path is A-B-E-G

6.
[7]

path length ( in days)

16
19
20
21

M1(all
paths)
A1(all
correct)
A1

c) total float of C = 11-2-7

=2
C can be delayed 2 days.

B1(see
total float)
B1

a) minimax = 4
maximin = 4
saddle point at (2, 2)
Value of the game = 4
It is flavor to Player P

M1
M1
A1
A1
B1

b) Player P : strategy II
Player Q : strategy II

B1
B1

7.
[15]

a) x : number of Jeans type I

y : number of Jeans type II
z : number of Jeans type III
Maximise profit f = 3x + 4.5y + 6z
Subject to
8x + 12y + 18z 5200
12x +18 y + 24z 6000
4x + 8y + 12z 2200

Tableu 1
x
f
-3
s1
8
s2 12
s3
4

y
-4.5
12
18
8

z
-6
18
24
12

Tableu 2
x
f
-1
s1 2
s2 4
z
1/3

y
-0.5
0
2
2/3

z
0
0
0
1

s1
0
1
0
0

Tableu 3
x
f
0
s1
0
x
1
z
0

y
0
-1
0.5
0.5

z
0
0
0
1

s1
0

s1
0
1
0
0

1
0
0

s2
0
0
1
0

s2
0
0
1
0

B1
B1
B1
B1
B1-formula
tion
And
definition

s3
0
0
0
1

solution
0
5200
6000
2200

s3 solution
0.5
1100
-1.5 1900
-2
1600
1/12 550/3

row
(1)
(2)
(3)
(4)

row
(6)=(1) +6(5)
(7)=(2) -18(5)
(8)=(3) -24(5)
(5)= (4)/4

s2
s3 solution
row
0.25
0
1500
(10)=(6) +(9)
-0.5 -0.5
1100
(11) = (7) 2(9)
0.25 -0.5
400
(9)= (8) /4
-1/6 1/4
50
(12)=(5) (9)/3

B1
B1

M1
A1

M1
A1

The manufacturer should make 400 units of Jeans Type I, 0 unit of

B1B1
Jeans Type II and 50 units of Jeans Type III to obtain a maximum profit B1
of RM1500.
B1
8.
[15]

a)

I
II ( 1 )

Optimal strategy for Rahman is strategy II and for Chua is strategy I.

M1
M1
B1B1

b) Suppose that Player B chooses strategy I with probability q and

strategy II with probability (1-q) :
Strategy of Player A
I
II
III
IV

Player Bs expected pay-off

-2q+(1-q)(0)= -2q
3q +(1-q)(-1) = 4q -1
-3q+ (1-q)(2) = -5q +2
5q + (1-q)(-4) = 9q -4

M1

expected pay-off for Player B

9q-4

4q-1

D1

2
0

-1

-2q
-5q+2

-2
-3

-4
At P (Minimax),
-5q + 2 = 4q -1
q = 1/3
Optimal mixed-strategy for Player B is to choose strategy I with
probability 1/3 and strategy II with probability 2/3.

M1
A1
A1

The pay-off matrix is

Suppose that Player A chooses strategy II with probability p and
strategy III with probability (1-p) :
Player As expected pay-off
3p+(1-p)(-3)= 6p -3
-p +(1-p)(2) = -3p +2

Strategy of Player B
I
II

M1

expected pay-off for Player A

3
6p-3

2
Q

-3p+2

-1
-3

At Q,
6p -3 = -3p +2
p = 5/9

M1

Optimal mixed-strategy for Player A is to choose strategy II and

strategy III only with probability 5/9 and 4/9 respectively.

A1
A1

Expected value of the game

= 6(5/9) 3 or -3(5/9)+2 or -5(1/3)+2 or 4(1/3) -1
= 1/3

M1
A1