Linear Programming - Worksheets, Questions and Revision
38 original exam-style questions - 16 pages of questions with a full mark scheme - free printable PDF.
Linear Programming revision guideMore IGCSE Maths practiceMock exams
This topic is chapter 2 of IGCSE Maths Topic Workbook 1 and chapter 2 of IGCSE Maths 10-Minute Tests.
2.1 Linear Programming
Write down an inequality for each condition, using x and y.
Write down an inequality for each condition, using x and y.
The points P(8, 11), Q(4, 7), R(15, 12), S(7, 29) are tested.
Which of the points lie inside R?
Write down an inequality for each condition, using x and y.
The points P(9, 10), Q(3, 19), R(16, 4), S(15, 25) are tested.
Which of the points lie inside R?
Write down an inequality for each condition, using x and y.
The points P(14, 19), Q(3, 30), R(9, 12), S(16, 22) are tested.
Which of the points lie inside R?
Write down an inequality for each condition, using x and y.
The points P(2, 18), Q(4, 19), R(3, 27), S(10, 3) are tested.
Which of the points lie inside R?
Write down an inequality for each condition, using x and y.
The points P(10, 24), Q(9, 15), R(2, 5), S(4, 3) are tested.
Which of the points lie inside R?
Write down an inequality for each condition, using x and y.
The points P(3, 26), Q(2, 4), R(3, 11), S(13, 4) are tested.
Which of the points lie inside R?
Write down an inequality for each condition, using x and y.
Write down the inequality, in x and y, that defines the shaded region.
The points P(8, 3), Q(18, 16), R(18, 21), S(8, 18) are tested.
Which of the points lie inside R?
The points P(5, 5), Q(2, 23), R(11, 2), S(2, 12) are tested.
Which of the points lie inside R?
The points P(13, 25), Q(6, 30), R(7, 11), S(9, 24) are tested.
Which of the points lie inside R?
The points P(4, 28), Q(11, 21), R(3, 4), S(1, 8) are tested.
Which of the points lie inside R?
Write down the inequality that defines the shaded region.
The points P(7, 3), Q(9, 16), R(2, 4), S(16, 27) are tested.
Which of the points lie inside R?
Question 1
- substitutes x = 5, y = 10 into 2x + y, e.g. 2(5) + 10M1
- correct conclusion: 2(5) + 10 = 20, and 20 ≤ 25 is true, so yes, (5, 10) satisfies the inequalityA1
- Answer: Yes: 2(5) + 10 = 20 ≤ 25
Question 2
- x ≥ 5B1
- y ≥ 2xB1
- x + y ≤ 30B1
- Answer: x ≥ 5, y ≥ 2x, x + y ≤ 30
Question 3
- (a) y ≤ 13B1
- (b) x + y ≥ 10B1
- (c) x + y ≤ 40B1
- Answer: (a) y ≤ 13; (b) x + y ≥ 10; (c) x + y ≤ 40
Question 4
- solves 5x + 2y ≥ 30 and 5x + 4y ≥ 40 simultaneously to find the corner where the lines crossM1
- corner at (4, 5)A1
- finds the other corners of the region on the axesM1
- evaluates C at each corner: (0, 15) gives 120; (4, 5) gives 52; (8, 0) gives 24M1
- minimum C = 24 at (8, 0)A1
- Answer: Minimum C = 24 at (8, 0)
Question 5
- (a) x ≤ yB1
- (b) 10x + 30y ≤ 360B1
- (c) y ≤ 24B1
- Answer: (a) x ≤ y; (b) 10x + 30y ≤ 360; (c) y ≤ 24
Question 6
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: P, Q, R; the other points break at least one inequalityA1
- Answer: P, Q, R
Question 7
- solves 3x + 2y ≥ 24 and x + 2y ≥ 12 simultaneously to find the corner where the lines crossM1
- corner at (6, 3)A1
- finds the other corners of the region on the axesM1
- evaluates C at each corner: (0, 12) gives 36; (6, 3) gives 33; (12, 0) gives 48M1
- minimum C = 33 at (6, 3)A1
- Answer: Minimum C = 33 at (6, 3)
Question 8
- checks x = 8 ≥ 5, true, and checks y = 20 ≥ 2(8) = 16, trueM1
- checks x + y = 8 + 20 = 28 ≤ 30, trueM1
- correctly concludes all three inequalities are satisfied, so (8, 20) is in the feasible region, csoA1
- Answer: (8, 20) satisfies all three inequalities
Question 9
- (a) x + y ≤ 24B1
- (b) x ≥ 7B1
- (c) x + y ≥ 8B1
- (d) y ≤ 4xB1
- Answer: (a) x + y ≤ 24; (b) x ≥ 7; (c) x + y ≥ 8; (d) y ≤ 4x
Question 10
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: P, R, S; the other points break at least one inequalityA1
- Answer: P, R, S
Question 11
- solves 3x + y ≤ 12 and x + y ≤ 8 simultaneously to find the corner where the lines crossM1
- corner at (2, 6)A1
- finds the other corners of the region on the axesM1
- evaluates P at each corner: (0, 0) gives 0; (0, 8) gives 64; (2, 6) gives 58; (4, 0) gives 20M1
- maximum P = 64 at (0, 8)A1
- Answer: Maximum P = 64 at (0, 8)
Question 12
- (a) x ≤ yB1
- (b) y ≥ 2xB1
- (c) x + y ≥ 12B1
- Answer: (a) x ≤ y; (b) y ≥ 2x; (c) x + y ≥ 12
Question 13
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: P, R; the other points break at least one inequalityA1
- Answer: P, R
Question 14
- solves x + 2y ≥ 10 and x + 3y ≥ 12 simultaneously to find the corner where the lines crossM1
- corner at (6, 2)A1
- finds the other corners of the region on the axesM1
- evaluates C at each corner: (0, 5) gives 45; (6, 2) gives 66; (12, 0) gives 96M1
- minimum C = 45 at (0, 5)A1
- Answer: Minimum C = 45 at (0, 5)
Question 15
- (a) y ≥ 3xB1
- (b) x + y ≤ 30B1
- (c) y ≤ 2xB1
- Answer: (a) y ≥ 3x; (b) x + y ≤ 30; (c) y ≤ 2x
Question 16
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: S; the other points break at least one inequalityA1
- Answer: S
Question 17
- identifies that x = 3 fails the condition x ≥ 5 (correctly checks the other two inequalities are satisfied: y = 25 ≥ 2(3) = 6 true, x + y = 28 ≤ 30 true)M1
- correct conclusion: since x = 3 < 5, the inequality x ≥ 5 is not satisfied, so (3, 25) is not in the feasible regionA1
- Answer: (3, 25) fails x ≥ 5, since 3 < 5
Question 18
- solves 2x + y ≥ 14 and 2x + 3y ≥ 30 simultaneously to find the corner where the lines crossM1
- corner at (3, 8)A1
- finds the other corners of the region on the axesM1
- evaluates C at each corner: (0, 14) gives 14; (3, 8) gives 11; (15, 0) gives 15M1
- minimum C = 11 at (3, 8)A1
- Answer: Minimum C = 11 at (3, 8)
Question 19
- (a) x ≤ yB1
- (b) x + y ≤ 50B1
- (c) 15x + 25y ≤ 300B1
- (d) y ≤ 10B1
- Answer: (a) x ≤ y; (b) x + y ≤ 50; (c) 15x + 25y ≤ 300; (d) y ≤ 10
Question 20
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: R, S; the other points break at least one inequalityA1
- Answer: R, S
Question 21
- solves x + y ≤ 11 and 4x + 7y ≤ 56 simultaneously to find the corner where the lines crossM1
- corner at (7, 4)A1
- finds the other corners of the region on the axesM1
- evaluates P at each corner: (0, 0) gives 0; (0, 8) gives 40; (7, 4) gives 27; (11, 0) gives 11M1
- maximum P = 40 at (0, 8)A1
- Answer: Maximum P = 40 at (0, 8)
Question 22
- (a) x + y ≤ 24B1
- (b) y ≤ 3xB1
- (c) y ≥ 4xB1
- (d) x ≤ yB1
- Answer: (a) x + y ≤ 24; (b) y ≤ 3x; (c) y ≥ 4x; (d) x ≤ y
Question 23
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: R, S; the other points break at least one inequalityA1
- Answer: R, S
Question 24
- solves x + y ≤ 6 and x + 2y ≤ 8 simultaneously to find the corner where the lines crossM1
- corner at (4, 2)A1
- finds the other corners of the region on the axesM1
- evaluates P at each corner: (0, 0) gives 0; (0, 4) gives 8; (4, 2) gives 40; (6, 0) gives 54M1
- maximum P = 54 at (6, 0)A1
- Answer: Maximum P = 54 at (6, 0)
Question 25
- (a) 15x + 30y ≤ 300B1
- (b) y ≤ 23B1
- (c) x + y ≤ 50B1
- (d) x ≥ 6B1
- Answer: (a) 15x + 30y ≤ 300; (b) y ≤ 23; (c) x + y ≤ 50; (d) x ≥ 6
Question 26
- finds the equation of the line using the two intercepts, e.g. -8x + 8y = -64M1
- tests the point (-6, 5) to decide which side is shadedM1
- x - y < 8 cao (dashed line so the inequality is strict)A1
- Answer: x - y < 8
Question 27
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: P; the other points break at least one inequalityA1
- Answer: P
Question 28
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: R; the other points break at least one inequalityA1
- Answer: R
Question 29
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: P, R, S; the other points break at least one inequalityA1
- Answer: P, R, S
Question 30
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: R, S; the other points break at least one inequalityA1
- Answer: R, S
Question 31
- substitutes x = -6 to find the line's y value -11 at that xM1
- compares -8 with -11 to decide above or below the lineM1
- y ≥ x - 5 caoA1
- Answer: y ≥ x - 5
Question 32
- finds the equation of the boundary line as x + y = 6, e.g. from gradient -1 and intercept 6M1
- x + y ≤ 6 cao (correct direction, confirmed by the origin satisfying it: 0 + 0 = 0 ≤ 6)A1
- Answer: x + y ≤ 6
Question 33
- substitutes each point into each of the three inequalitiesM1
- correct decision for each point (at least three correct)A1
- inside R: R; the other points break at least one inequalityA1
- Answer: R
Question 34
- any valid point with x ≥ 5, x + y ≤ 30 and y < 2x, e.g. (5, 5): 5 ≥ 5 true, 5 + 5 = 10 ≤ 30 true, but 5 < 2(5) = 10, so y ≥ 2x fails; accept any other correct example, e.g. (10, 1)B1
- Answer: e.g. (5, 5)
Question 35
- attempts P at each of the four verticesM1
- all four values correct: P(0,0) = 0, P(0,5) = 150, P(4,3) = 170, P(6,0) = 120A1
- correct conclusion: maximum P = 170, occurring at (4, 3)A1
- Answer: Maximum P = 170 at (4, 3)
Question 36
- shows that a total of 3 vehicles is not enough, e.g. the largest possible capacity with 3 vehicles is achieved by using all coaches, 3 x 50 = 150, which is less than 200M1
- shows that a total of 4 vehicles can work, e.g. x = 0, y = 4 gives capacity 15(0) + 50(4) = 200, which meets the requirement exactlyM1
- minimum total number of vehicles = 4 caoA1
- correctly states this is achieved with x = 0 minibuses and y = 4 coaches (any mix of 4 vehicles including at least one minibus gives capacity below 200, e.g. 1 minibus and 3 coaches gives 15 + 150 = 165 < 200)B1
- Answer: Minimum 4 vehicles: 0 minibuses and 4 coaches
Question 37
- (a) x ≥ 0 and y ≥ 0 (both stated)B1
- (a) Answer: x ≥ 0, y ≥ 0
- (b) sets up the simultaneous equations and eliminates one variable correctly, e.g. subtracts x + y = 8 from 2x + y = 14 to get x = 6M1
- (b) substitutes back to find the other variable, e.g. y = 8 - 6M1
- (b) (6, 2) cao (both coordinates correct)A1
- (b) Answer: (6, 2)
- (c) (0, 8): where x + y = 8 meets the y-axis (this is more restrictive there than 2x + y = 14, which would allow (0, 14))B1
- (c) (7, 0): where 2x + y = 14 meets the x-axis (this is more restrictive there than x + y = 8, which would allow (8, 0))B1
- (c) Answer: (0, 8) and (7, 0)
- (d) attempts P at all four verticesM1
- (d) all four values correct: P(0,0) = 0, P(0,8) = 320, P(6,2) = 380, P(7,0) = 350A1
- (d) correctly identifies the maximum as P = 380A1
- (d) states this occurs at x = 6, y = 2 (6 standard benches and 2 deluxe benches), ft from their vertex valuesA1
- (d) Answer: Maximum profit = £380, with 6 standard benches and 2 deluxe benches
- (e) 6 standard benches and 2 deluxe benches each day, giving a maximum daily profit of £380, ft from part (d)B1
- (e) Answer: 6 standard benches and 2 deluxe benches per day, for a maximum profit of £380
Question 38
- (a) the farmer cannot buy a negative number of bags of feed, oeB1
- (a) Answer: The farmer cannot buy a negative number of bags
- (b) rearranges one equation, e.g. y = 8 - 2x from the first equationM1
- (b) substitutes correctly into the other equation and solves, e.g. x + 2(8 - 2x) = 10 leading to -3x = -6M1
- (b) (2, 4) cao (both coordinates correct)A1
- (b) Answer: (2, 4)
- (c) (0, 8) is on the line 2x + y = 8, and checking x + 2y = 0 + 16 = 16, which is ≥ 10, so it satisfies the other constraintB1
- (c) (10, 0) is on the line x + 2y = 10, and checking 2x + y = 20 + 0 = 20, which is ≥ 8, so it satisfies the other constraintB1
- (c) Answer: Both points satisfy the other inequality
- (d) attempts C at all three verticesM1
- (d) all three values correct: C(0,8) = 40, C(2,4) = 26, C(10,0) = 30A1
- (d) correctly identifies the minimum as C = 26, at x = 2, y = 4 (2 bags of feed P and 4 bags of feed Q)A1
- (d) Answer: Minimum cost = £26, with 2 bags of feed P and 4 bags of feed Q
Mark your answers
Check answers without an account. Some answers can be checked automatically; use the mark scheme to mark the rest.