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

Linear Programming

This document contains fully worked solutions to multiple linear programming word problems from a SPM practice paper. The summaries are: 1) It summarizes the constraints and optimal solutions to 4 word problems on maximizing seafood purchases within a budget. 2) It summarizes the constraints and optimal solutions to 2 word problems, one on participant numbers at an event and one on ball purchases. 3) It finds the minimum cost of purchasing balls given constraints on totals and ratios. 4) It summarizes the constraints and determines the optimal production amounts for 2 machines given time limits. 5) It summarizes the constraints and determines the optimal production amounts to maximize profits given material and ratio limits.

Uploaded by

SaraCarson
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
0% found this document useful (0 votes)
299 views4 pages

Linear Programming

This document contains fully worked solutions to multiple linear programming word problems from a SPM practice paper. The summaries are: 1) It summarizes the constraints and optimal solutions to 4 word problems on maximizing seafood purchases within a budget. 2) It summarizes the constraints and optimal solutions to 2 word problems, one on participant numbers at an event and one on ball purchases. 3) It finds the minimum cost of purchasing balls given constraints on totals and ratios. 4) It summarizes the constraints and determines the optimal production amounts for 2 machines given time limits. 5) It summarizes the constraints and determines the optimal production amounts to maximize profits given material and ratio limits.

Uploaded by

SaraCarson
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 4

Form 5: Chapter 21 (Linear Programming) SPM Practice Fully-Workerd Solutions

Paper 2 1 (a) The total mass of seafood is not less than 20 kg. The inequality is x + y 20.
x y 0 20 20 0

(c) If the restaurant buys 15 kg of squids, y = 15. From the graph, when y = 15, the minimum value of x = 5. Therefore, if the restaurant buys 15 kg of squids, the minimum mass of prawns it can buy is 5 kg. Total expenditure = 10x + 5y When x = 5 and y = 15, the total expenditure = 10(5) + 5(15) = RM125 Hence, the maximum amount of money that could remain from its allocation is RM250 RM125 = RM125. 2 (a) The total number of participants is at least 30. The inequality is x + y 30.
x 0 30 30 0

The mass of prawns is at most three times that of squids. The inequality is x 3y.
x y 0 0 30 10

The allocation is RM250. The inequality is 10x + 5y 250 2x + y 50


x y 0 50 25 0

(b)
y 50 45 40 35 30 25 20 15 10 5 x 5 10 15 20 25 30 x = 3y x + y = 20

The number of Mathematics participants is at most twice that of Science. The inequality is y 2x.
2x + y = 50

x y

0 0

30 60

The expenditure for a Science participant and a Mathematics participant are RM80 and RM60 respectively. The maximum allocation is RM3600. The inequality is 80x + 60y 3600 4x + 3y 180.
x y 0 60 45 0

81

(b)
60 50 40

y = 2x

For the constraint the number of footballs bought should exceed the number of volleyballs bought by at least 15, the inequality is y x 15.
x 0 15 40 55

x + y = 30

30 20 10
8
min (10, 20)

4x + 3y = 180

18 36 45 10 20 30 40 50 80x + 60y = 480 6

60

(b)
80 70

y y = 4x max (16, 64)

(c)

(i) When y = 12, from the graph, xmin = 18 and xmax = 36. Hence, when the number of Mathematics participants is 12, the minimum and maximum number of Science participants are 18 and 36 respectively. (ii) Cost = 80x + 60y Draw the straight line 80x + 60y = 480
x y 0 8 6 0

60
55

y x = 15

50 40 30 20
15

60

x+

80

x + y = 80
y= 48 00

10 O

10 20 25 30 40 50 60 70 80

(c)

(i) From the graph, if the number of volleyballs bought is 25 (x = 25), the range of the number of footballs bought is 40 y 55. (ii) Cost = 60x + 80y Draw the straight line 60x + 80y = 4800.
x y 0 60 80 0

For minimum cost, from the graph, xmin = 10 and ymin = 20. Hence, the minimum cost = 80x + 60y = 80(10) + 60(20) = RM2000 3 (a) For the constraint the total number of balls bought should not be more than 80, the inequality is x + y 80.
x y 0 80 80 0

From the graph, the optimal point is (16, 64). Hence, the maximum cost = 60(16) + 80(64) = RM6080 4 (a) The maximum time for the use of machine P is 12 hours: 60x + 20y 12 60 3x + y 36
x y 0 36 12 0 6 18

For the constraint the number of footballs bought should not be more than 4 times the number of volleyballs bought, the inequality is y 4x.
x y 0 0 20 80

(0, 36) is out of the graph paper. So, another point (6, 18) has to be determined.

82

The use of machine Q is at least 8 hours: 30x + 40y 8 60 3x + 4y 48


x y 0 12 16 0

5 (a)

I x + y 500
x y 0 500 400 100

II x 3y
x y 0 0 300 100

The ratio of the number of Premier pewter plates produced to the number of Royal pewter plates produced is at least 1 : 3. x 1 y 3 3x y y 3x
x y 0 0 6 18

III 5x + 3y 1500
x y 0 500 300 0

(b) (b)
18 16 y = 3x 14 12 10 8 6 4 2 O 2 4 6 8 10 12 R 3x + y = 36 300 250 R 200 3x + 4y = 48 x 14 16 50 O 50 100 150 200 250 300 350 400 x 150 100
x=3 y

y max (6, 18)

y 500 450 400 350


5x +3 y= 15 00

x +y = 500

10 = 1 0x + 40 14 0 0y

max (375, 125)

(c)

(i) From the graph, if y =12, xmax = 8 (ii) Profits = 100x + 140y Draw the straight line 100x +140y =1400
x y 0 10 14 0

(c)

(i) When x = 150, ymin = 250 (ii) Profits = 5x + 3y Draw the straight line 5x + 3y = 1500.
Already drawn in (b).

From the graph, the optimal point = (6, 18) Hence, the maximum profit = 100(6) +140(18) = RM3120

From the graph, the optimal point is (375, 125). Hence, the maximum profit = 5(375) + 3(125) = RM2250

83

6 (a)

I x+y7
x y 0 7 7 0

(c)

(i) If x = 2, from the graph, ymin = 1 (ii) Number of members = 46x + 10y Draw the straight line 46x + 10y = 46.

II

x 3y 3y x
x y 0 0 6 2

x y

0 4.6

1 0

III 700x + 200y 3500 7x + 2y 35


x y 0 17.5 5 0 3 7

Optimal point is (4, 3). Hence, the maximum number of members = 46(4) + 10(3) = 214

Not usable because the point is out of the graph paper.

(b)
y 7 x +y = 7 6 5 4.6 4 max (4, 3) R x = 3y 7x + 2y = 35

46 x + 10y = 46
1 2

3 2 1 O

84

You might also like