Professional Documents
Culture Documents
10 Linear Programming
Linear Programming
To answer this question, CANDIDATES must be able to .....
form inequalities from given mathematical information draw the related straight lines using suitable scales on both axes (scales given !!!)
recognise and shade the region representing the inequalities
solve maximising or minimising problems from the objective function (minimum cost, maximum profit ....)
< >
KEY WORDS
is at least
is at most The minimum vale of x is . The maximum value of y is .. p must not exceed
SIGN OF INEQUALITY
x y p
x<100
P > Q
A 75
W 80
KEY WORDS
Y is at least 35
SIGN OF INEQUALITY
X at most 100
The minimum vale of x is 5 The maximum value of y is 250
y 35 X 100 x 5 y 250 V 60
Statements
1. x is at least 10 2. x is not more than 80
Inequality x 10 x 80
x y y 2x
x 100 y 35 x + 2y 60 3x - 2y 18
5. The maximum value of x is 100 6. The minimum value of y is 35 7. The maximum value of x+ 2y is 60 8. The minimum value of 3x 2y is 18
Linear Programming
Mathematical Statement
9. P(x) is at least thrice the value of Q(y) 10. The sum of x and y is at most 120 11. 3x + 2y must exceed 180 12. The sum of x and y is not less than 50 13. The sum of x and y must exceed 40 14. x must exceed y by at least 10
Inequality
x 3y x + y 120 3x + 2y > 180 x + y 50 x + y > 40 x y + 10
15. The ratio of the quantity of Q (y) to the quantity of P (x) should not exceed 2 : 1
16. The number of units of model B (y) exceeds twice the number of units of model A (x) by 10 or more.
y 2x
y - 2x 10
Linear Programming
Key Words
1. x is at least 10 2. x is not more than 80 3. x is not more than y 4. The value of y is at least twice the value of x 5. The maximum value of x is 100 6. The minimum value of y is 35 7. The maximum value of x+ 2y is 60 8. The minimum value of 3x 2y is 18 9. The sum of x and y is not less than 50 10. The sum of x and y must exceed 40 11. x must exceed y by at least 10 12. The ratio of the quantity of Q (y) to the quantity of P (x) should not exceed 2 : 1 13. The number of units of model B (y) exceeds twice the number of units of model A (x) by 10 or more.
Sign of Inequality
x 10
x 80
x y y 2x x 100 y 35 x + 2y 60 3x - 2y 18 x + y 50 x + y > 40 x y + 10
y 2x
y - 2x 10
eq. x 2y
F5
LINEAR PROGRAMMING
Apples and oranges are sold in packets at a fruit stall. Each packet of apples has 3 fruits and each packet of oranges has 4 fruits. Each day, x packets of apples and y packets of oranges are sold . The sale of fruit per day is based on the following constraints:
I : The minimum number of packets of oranges sold is 30 . II : The total number of packets of apples and oranges sold is at least 120. III : The total number of apples and oranges sold does not exceed 600. (a) Write three inequalities, other than and x0, y0 , which satisfy all the above constraints. [3 marks]
(b) By using a scale of 2 cm to 20 packets on both axes, draw and shade the region R, that satisfies all of the conditions above. [2 marks] (c) Using your graph from (b), to find the maximum packets of oranges sold each day . the maximum profit obtained when a packet of apples and a packet of oranges brings a profit of RM0.50 and RM0.60 respectively. [5 marks]
160
140
x + y = 200
120
100
80
R
x + y = 120
60
40
y = 30
20
20
40
60
80
100
120
140
160
180
200
160
140
120
3x+4 y = 600
100
80
x + y = 120
R
y = 30
60
40
20
20
40
60
80
100
120
140
160
180
200
Answers:
14(a) I y 30 N1 II x + y 120 N1 III 3x + 4y 600 N1 [Cannot have sign =] (b) One of the graph of straight lines is correct K1 All the graph of straight lines are correct K1 The shaded region of R is correct N1 (c) (i) 150 packets N1 (ii) Optimum point (160,30) based on the graph N1 Substitute any number based on the value in shaded region K1 Maximum profit : RM 98 N1
10