D1.5.2 Graphical solution of two variable problems using objective line…

Section
D1.5 Linear programming
Level
AS & A level
Statement
Graphical solution of two variable problems using objective line and vertex methods including cases where integer solutions are required.
Since 2018
20 parts, 77 marks · topic pages: Linear programming: formulation, graphs and the Simplex algorithm

Back to the checklist

June 2025 · AS Paper 2 (Decision 1) · Q4(a) 1 mark
4 y x Figure 3 George is a baker who bakes x sponge cakes and y fruit cakes every day. One of George’s constraints is shown on Figure 3. (a) Write down this constraint as a simplified inequality with integer coefficients. (1)
June 2025 · AS Paper 2 (Decision 1) · Q4(b) 5 marks
Three further constraints are • George must bake at least four fruit cakes every day • for every two sponge cakes George bakes, he must bake at most three fruit cakes • George needs 200 g of butter for each sponge cake and 100 g for each fruit cake and has 2.8 kg of butter available each day (b) (i) Write down the three inequalities which model these constraints. Give your answers in simplified form with integer coefficients. (ii) Add lines and shading to Diagram 1 in the answer book to represent these three constraints. Hence determine the feasible region and label it R. (5)
June 2025 · AS Paper 2 (Decision 1) · Q4(c) 5 marks
George makes £8 profit from each sponge cake he sells and £5 profit from each fruit cake he sells. Given that he wishes to maximise his profit, (c) use the vertex method to determine the number of sponge cakes and the number of fruit cakes George should bake each day. You must make your method and working clear. (5)
June 2024 · AS Paper 2 (Decision 1) · Q4(a) 3 marks
4. y x –5 Figure 4 Figure 4 shows three of the six constraints for a linear programming problem in x and y The unshaded region and its boundaries satisfy these three constraints. (a) State these three constraints as simplified inequalities with integer coefficients. (3)
June 2024 · AS Paper 2 (Decision 1) · Q4(c) 3 marks
P75677A (c) Represent these three constraints by adding lines and shading to Diagram 1 in the answer book, labelling the feasible region, R (3)
June 2024 · AS Paper 2 (Decision 1) · Q4(d) 4 marks
The total value (in pounds) of the fish in the aquarium is given by the objective function Maximise P = 3x + 5y (d) (i) Use the objective line method to determine the optimal point of the feasible region, giving its coordinates as exact fractions. (ii) Hence find the maximum total value of the fish in the aquarium, stating the optimal number of orange fish and the optimal number of blue fish. (4)
June 2023 · AS Paper 2 (Decision 1) · Q4(a) 2 marks
4. y x = 8 3y = 4x + 5 R 4x + 15y = 120 objective line x 3x + 8y = 32 Figure 3 Figure 3 shows the constraints of a linear programming problem in x and y. The unshaded area, including its boundaries, forms the feasible region, R. An objective line has been drawn and labelled on the graph. (a) State the inequalities that define the feasible region. (2)
June 2023 · AS Paper 2 (Decision 1) · Q4(b) 5 marks
The maximum value of the objective function is 160 The minimum value of the objective function is 883 (b) Determine the objective function, showing your working clearly. (5)
June 2022 · AS Paper 2 (Decision 1) · Q4(a) 3 marks
4. y 14 12 10 R Objective line x Figure 3 Figure 3 shows the constraints of a maximisation linear programming problem in x and y, where x 0 and y 0 . The unshaded area, including its boundaries, forms the feasible region, R. An objective line has been drawn and labelled on the graph. (a) List the constraints as simplified inequalities with integer coefficients. (3)
June 2022 · AS Paper 2 (Decision 1) · Q4(b) 5 marks
The optimal value of the objective function is 216 (b) (i) Calculate the exact coordinates of the optimal vertex. (ii) Hence derive the objective function. (5)
June 2022 · AS Paper 2 (Decision 1) · Q4(c) 1 mark
Given that x represents the number of small flower pots and y represents the number of large flower pots supplied to a customer, (c) deduce the optimal solution to the problem. (1)
Oct 2020 · AS Paper 2 (Decision 1) · Q4 9 marks
4. y R objective line V x –2 Figure 3 Figure 3 shows the constraints of a linear programming problem in x and y, where R is the feasible region. Figure 3 also shows an objective line for the problem and the optimal vertex, which is labelled as V. The value of the objective at V is 556 Express the linear programming problem in algebraic form. List the constraints as simplified inequalities with integer coefficients and determine the objective. (9)
Oct 2020 · Paper 3D (Decision 1) · Q4(a) 2 marks
4. y 2y = 5x 7 – y = x + 1 6 – 5 – 4 – R 3 – 2 – 1 – – – – – – – – x 6x + 5y = 30 Figure 3 Figure 3 shows the constraints of a linear programming problem in x and y, where R is the feasible region. (a) Write down the inequalities that define R. (2)
Oct 2020 · Paper 3D (Decision 1) · Q4(b) 4 marks
The objective is to maximise P, where P = 3x + y (b) Obtain the exact value of P at each of the three vertices of R and hence find the optimal vertex, V. (4)
Oct 2020 · Paper 3D (Decision 1) · Q4(c) 4 marks
The objective is changed to maximise Q, where Q = 3x + ay. Given that a is a constant and the optimal vertex is still V, (c) find the range of possible values of a. (4)
June 2019 · AS Paper 2 (Decision 1) · Q5(b) 3 marks
Ben decides to order the minimum number of roses that satisfy his constraints. (b) (i) Calculate the number of each type of flower that he will order to minimise the cost of the flowers. (ii) Calculate the corresponding total cost of this order. (3)
June 2019 · Paper 3D (Decision 1) · Q7(b) 4 marks
Two further constraints are y + 3x . 140 4y + x . 80 (b) Represent all these constraints on Diagram 1 in the answer book. Hence determine, and label, the feasible region, R. (4)
June 2019 · Paper 3D (Decision 1) · Q7(c) 3 marks
The cost to the shop of ordering an analogue watch is five times the cost of ordering a digital watch. The shop manager wishes to minimise the total cost. (c) Determine the number of each type of watch the shop manager should order. You must make your method clear. (3)
June 2019 · Paper 3D (Decision 1) · Q7(d) 3 marks
Given that the minimum total cost of ordering the watches is £4455 (d) determine the cost of ordering one analogue watch and the cost of ordering one digital watch. You must make your method clear. (3)
June 2018 · AS Paper 2 (Decision 1) · Q4(c) 8 marks
Due to demand, exactly 150 cabinets must be produced during these three weeks. This reduces the constraints to x+y <75 x + 3y > 150 x > 25 y20 which are shown in Diagram| in the answer book. Given that the manager does not want any cabinets left unfinished at the end of a week, (c) (i) use a graphical approach to solve the linear programming problem and hence determine the production schedule which minimises the cost of production. You should make your method and working clear. (ii) Find the minimum total cost of the production schedule. (8)

Find an Edexcel Further Maths tutor

Stuck on this? Book a trial lesson with our Further Maths tutor.

Prefer email? Send an enquiry

If you are under 18, please include a parent's contact details. Enquiries go to enquiries@alevelfurthermathstutor.com and are deleted once handled.