Skip to content

Linear programming: Edexcel A‑Level Further Maths questions

Every Edexcel A-Level Further Maths exam question on D.4 Linear programming, 2018–2025, with its mark scheme and examiner’s report.

Find questions824

824 questions

  1. Q5

    June 2025 · Decision 1

    The whole paper ↗
    June 2025 Decision 1, question 5: Consider the following linear programming problem in x, y and z. Maximise P x y z 3 4 2 subject to 2 2 2 21 x y z + +  2 18 x y z − −  3 2 1 x y z  x 4 y 1 z
  2. Q7

    June 2025 · Decision 1

    The whole paper ↗
    June 2025 Decision 1, question 7: Figure 5 Figure 5 shows the constraints of a linear programming problem in x and y, where R is the feasible region. The objective is to maximise P x ky 11 , whe
  3. Q4

    June 2025 · AS Decision 1

    The whole paper ↗
    June 2025 AS Decision 1, question 4: 4 4 8 12 16 20 24 28 32 y x 2 O 4 6 8 10 12 14 16 Figure 3 George is a baker who bakes x sponge cakes and y fruit cakes every day. One of George’s constraints i
  4. Q5

    June 2024 · Decision 1

    The whole paper ↗
    June 2024 Decision 1, question 5: Two friends, Anaira and Tommi, play a game involving two positive numbers x and y Anaira gives Tommi the following clues to see if he can correctly determine th
  5. Q7

    June 2024 · Decision 1

    The whole paper ↗
    June 2024 Decision 1, question 7: A maximisation linear programming problem in x, y and z is to be solved using the Simplex method. The tableau after the 1st iteration is shown below. b.v. x y z
  6. Q4

    June 2024 · AS Decision 1

    No published mark scheme
    The whole paper ↗
    June 2024 AS Decision 1, question 4:  P75677A 4. 0 –5 5 10 15 20 25 30 5 10 15 20 25 30 x y Figure 4 Figure 4 shows three of the six constraints for a linear programming problem in x and y The
  7. Q7

    June 2023 · Decision 1

    The whole paper ↗
    June 2023 Decision 1, question 7: A publisher plans to produce three versions of the same book: a paperback, a hardcover, and a deluxe edition. • Each paperback takes 4 minutes to print and 1 mi
  8. Q4

    June 2023 · AS Decision 1

    The whole paper ↗
    June 2023 AS Decision 1, question 4: O x y R objective line 3x + 8y = 32 3y = 4x + 5 x = 8 4x + 15y = 120 Figure 3 Figure 3 shows the constraints of a linear programming problem in x and y. The uns
  9. Q4

    June 2022 · Decision 1

    The whole paper ↗
    June 2022 Decision 1, question 4: A linear programming problem in x, y and z is to be solved using the big‑M method. The initial tableau is shown below. b.v. x y z s1 s2 s3 a1 a2 Value s1 2 3 4
  10. Q7

    June 2022 · Decision 1

    The whole paper ↗
    June 2022 Decision 1, question 7: y y = 2x + 1 x + y = 8 7x + 2y = 46 x + 2y = 12 x R O Figure 5 Figure 5 shows the constraints of a linear programming problem in x and y where R is the feasible
  11. Q4

    June 2022 · AS Decision 1

    The whole paper ↗
    June 2022 AS Decision 1, question 4: y x 16 14 12 10 8 6 4 2 0 14 12 10 8 6 4 2 0 R Objective line Figure 3 Figure 3 shows the constraints of a maximisation linear programming problem in x and y, w
  12. Q8

    November 2021 · Decision 1

    The whole paper ↗
    November 2021 Decision 1, question 8: Susie is preparing for a triathlon event that is taking place next month. A triathlon involves three activities: swimming, cycling and running. Susie decides th
  13. Q4

    November 2020 · Decision 1

    The whole paper ↗
    November 2020 Decision 1, question 4: y O 7 – 6 – 5 – 4 – 3 – 2 – 1 – 1 2 3 4 5 x 2y = 5x 6x + 5y = 30 R y = x + 1 – – – – – – – Figure 3 Figure 3 shows the constraints of a linear programming probl
  14. Q7

    November 2020 · Decision 1

    The whole paper ↗
    November 2020 Decision 1, question 7: A maximisation linear programming problem in x, y and z is to be solved using the two-stage simplex method. The partially completed initial tableau is shown bel
  15. Q4

    November 2020 · AS Decision 1

    The whole paper ↗
    November 2020 AS Decision 1, question 4: 2 R V objective line 4 6 8 10 x y 12 12 10 8 6 4 2 0 –2 Figure 3 Figure 3 shows the constraints of a linear programming problem in x and y, where R is the feasi
  16. Q6

    June 2019 · Decision 1

    The whole paper ↗
    June 2019 Decision 1, question 6: A linear programming problem in x, y and z is described as follows. Maximise P = 2x + 2yíz subject to 3x + y + 2z - 30 xíy + z . 8 4y + 2z . 15 x, y, z . 0
  17. Q7

    June 2019 · Decision 1

    The whole paper ↗
    June 2019 Decision 1, question 7: A shop sells two types of watch, analogue watches and digital watches. The shop manager knows that, each month, she should order at least 60 watches in total. I
  18. Q5

    June 2019 · AS Decision 1

    The whole paper ↗
    June 2019 AS Decision 1, question 5: Ben is a wedding planner. He needs to order flowers for the weddings that are taking place next month. The three types of flower he needs to order are roses, hy
All 18 questions on Linear programming, as a list
  1. June 2025, Decision 1, Q5 (12 marks): Consider the following linear programming problem in x, y and z. Maximise P x y z 3 4 2 subject to 2 2 2 21 x y z + +  2 18 x y z − −  3 2 1 x y z  x 4 y 1 z
  2. June 2025, Decision 1, Q7 (12 marks): Figure 5 Figure 5 shows the constraints of a linear programming problem in x and y, where R is the feasible region. The objective is to maximise P x ky 11 , whe
  3. June 2025, AS Decision 1, Q4 (11 marks): 4 4 8 12 16 20 24 28 32 y x 2 O 4 6 8 10 12 14 16 Figure 3 George is a baker who bakes x sponge cakes and y fruit cakes every day. One of George’s constraints i
  4. June 2024, Decision 1, Q5 (9 marks): Two friends, Anaira and Tommi, play a game involving two positive numbers x and y Anaira gives Tommi the following clues to see if he can correctly determine th
  5. June 2024, Decision 1, Q7 (14 marks): A maximisation linear programming problem in x, y and z is to be solved using the Simplex method. The tableau after the 1st iteration is shown below. b.v. x y z
  6. June 2024, AS Decision 1, Q4 (12 marks):  P75677A 4. 0 –5 5 10 15 20 25 30 5 10 15 20 25 30 x y Figure 4 Figure 4 shows three of the six constraints for a linear programming problem in x and y The
  7. June 2023, Decision 1, Q7 (19 marks): A publisher plans to produce three versions of the same book: a paperback, a hardcover, and a deluxe edition. • Each paperback takes 4 minutes to print and 1 mi
  8. June 2023, AS Decision 1, Q4 (7 marks): O x y R objective line 3x + 8y = 32 3y = 4x + 5 x = 8 4x + 15y = 120 Figure 3 Figure 3 shows the constraints of a linear programming problem in x and y. The uns
  9. June 2022, Decision 1, Q4 (6 marks): A linear programming problem in x, y and z is to be solved using the big‑M method. The initial tableau is shown below. b.v. x y z s1 s2 s3 a1 a2 Value s1 2 3 4
  10. June 2022, Decision 1, Q7 (15 marks): y y = 2x + 1 x + y = 8 7x + 2y = 46 x + 2y = 12 x R O Figure 5 Figure 5 shows the constraints of a linear programming problem in x and y where R is the feasible
  11. June 2022, AS Decision 1, Q4 (9 marks): y x 16 14 12 10 8 6 4 2 0 14 12 10 8 6 4 2 0 R Objective line Figure 3 Figure 3 shows the constraints of a maximisation linear programming problem in x and y, w
  12. November 2021, Decision 1, Q8 (18 marks): Susie is preparing for a triathlon event that is taking place next month. A triathlon involves three activities: swimming, cycling and running. Susie decides th
  13. November 2020, Decision 1, Q4 (10 marks): y O 7 – 6 – 5 – 4 – 3 – 2 – 1 – 1 2 3 4 5 x 2y = 5x 6x + 5y = 30 R y = x + 1 – – – – – – – Figure 3 Figure 3 shows the constraints of a linear programming probl
  14. November 2020, Decision 1, Q7 (17 marks): A maximisation linear programming problem in x, y and z is to be solved using the two-stage simplex method. The partially completed initial tableau is shown bel
  15. November 2020, AS Decision 1, Q4 (9 marks): 2 R V objective line 4 6 8 10 x y 12 12 10 8 6 4 2 0 –2 Figure 3 Figure 3 shows the constraints of a linear programming problem in x and y, where R is the feasi
  16. June 2019, Decision 1, Q6 (12 marks): A linear programming problem in x, y and z is described as follows. Maximise P = 2x + 2yíz subject to 3x + y + 2z - 30 xíy + z . 8 4y + 2z . 15 x, y, z . 0
  17. June 2019, Decision 1, Q7 (12 marks): A shop sells two types of watch, analogue watches and digital watches. The shop manager knows that, each month, she should order at least 60 watches in total. I
  18. June 2019, AS Decision 1, Q5 (10 marks): Ben is a wedding planner. He needs to order flowers for the weddings that are taking place next month. The three types of flower he needs to order are roses, hy

Questions, mark schemes and examiner’s reports are © Pearson Edexcel, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Every Edexcel A-Level Further Maths paper.

Rather write your answers by hand on iPad? Plumi marks them against the same mark schemes.