Linear programming calculator worksheet with answers

A-level: AS and A2 Tiers are typical for England, Wales and Northern Ireland specifications. Boards differ, so check your own specification.

10 practice questions on linear programming calculator. Print the questions on their own, or with the answers. Worked solutions for any question are one click away in the solver.

Open the Worksheet Studio
  1. maximise P = 3x + 2y subject to x + y <= 10, x >= 0, y >= 0, x <= 6
  2. minimise C = 2x + 5y subject to x + y >= 4, x >= 0, y >= 0
  3. maximise P = 5x + 4y subject to 6x + 4y <= 24, x + 2y <= 6, x >= 0, y >= 0
  4. minimise C = 2x + 4y subject to x + y >= 2, x >= 0, y >= 0
  5. maximise P = 2x + 6y subject to 8x + 4y <= 27, x + 2y <= 5, x >= 0, y >= 0
  6. maximise P = 4x + 2y subject to x + y <= 10, x >= 0, y >= 0, x <= 7
  7. minimise C = 2x + 8y subject to x + y >= 3, x >= 0, y >= 0
  8. maximise P = 5x + 2y subject to 5x + 6y <= 21, x + 2y <= 3, x >= 0, y >= 0
  9. maximise P = 4x + 3y subject to x + y <= 7, x >= 0, y >= 0, x <= 6
  10. minimise C = 2x + 7y subject to x + y >= 3, x >= 0, y >= 0

Answers

  1. maximise P = 3x + 2y subject to x + y <= 10, x >= 0, y >= 0, x <= 6
    Show the working
    1. Objective and constraints
    2. Corner points of the feasible region
      The best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
    3. Value of the objective at each corner
    4. Check: no other feasible point does better

    Open this question in the solver

  2. minimise C = 2x + 5y subject to x + y >= 4, x >= 0, y >= 0
    Show the working
    1. Objective and constraints
    2. Corner points of the feasible region
      The best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
    3. Value of the objective at each corner
    4. Check: no other feasible point does better

    Open this question in the solver

  3. maximise P = 5x + 4y subject to 6x + 4y <= 24, x + 2y <= 6, x >= 0, y >= 0
    Show the working
    1. Objective and constraints
    2. Corner points of the feasible region
      The best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
    3. Value of the objective at each corner
    4. Check: no other feasible point does better

    Open this question in the solver

  4. minimise C = 2x + 4y subject to x + y >= 2, x >= 0, y >= 0
    Show the working
    1. Objective and constraints
    2. Corner points of the feasible region
      The best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
    3. Value of the objective at each corner
    4. Check: no other feasible point does better

    Open this question in the solver

  5. maximise P = 2x + 6y subject to 8x + 4y <= 27, x + 2y <= 5, x >= 0, y >= 0
    Show the working
    1. Objective and constraints
    2. Corner points of the feasible region
      The best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
    3. Value of the objective at each corner
    4. Check: no other feasible point does better

    Open this question in the solver

  6. maximise P = 4x + 2y subject to x + y <= 10, x >= 0, y >= 0, x <= 7
    Show the working
    1. Objective and constraints
    2. Corner points of the feasible region
      The best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
    3. Value of the objective at each corner
    4. Check: no other feasible point does better

    Open this question in the solver

  7. minimise C = 2x + 8y subject to x + y >= 3, x >= 0, y >= 0
    Show the working
    1. Objective and constraints
    2. Corner points of the feasible region
      The best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
    3. Value of the objective at each corner
    4. Check: no other feasible point does better

    Open this question in the solver

  8. maximise P = 5x + 2y subject to 5x + 6y <= 21, x + 2y <= 3, x >= 0, y >= 0
    Show the working
    1. Objective and constraints
    2. Corner points of the feasible region
      The best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
    3. Value of the objective at each corner
    4. Check: no other feasible point does better

    Open this question in the solver

  9. maximise P = 4x + 3y subject to x + y <= 7, x >= 0, y >= 0, x <= 6
    Show the working
    1. Objective and constraints
    2. Corner points of the feasible region
      The best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
    3. Value of the objective at each corner
    4. Check: no other feasible point does better

    Open this question in the solver

  10. minimise C = 2x + 7y subject to x + y >= 3, x >= 0, y >= 0
    Show the working
    1. Objective and constraints
    2. Corner points of the feasible region
      The best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
    3. Value of the objective at each corner
    4. Check: no other feasible point does better

    Open this question in the solver

Learn the method: Linear programming calculator solver and worked examples. All worksheets: worksheet index.