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.
Name: ______________ Date: ________ Score: ____ / 10
maximise P = 3x + 2y subject to x + y <= 10, x >= 0, y >= 0, x <= 6minimise C = 2x + 5y subject to x + y >= 4, x >= 0, y >= 0maximise P = 5x + 4y subject to 6x + 4y <= 24, x + 2y <= 6, x >= 0, y >= 0minimise C = 2x + 4y subject to x + y >= 2, x >= 0, y >= 0maximise P = 2x + 6y subject to 8x + 4y <= 27, x + 2y <= 5, x >= 0, y >= 0maximise P = 4x + 2y subject to x + y <= 10, x >= 0, y >= 0, x <= 7minimise C = 2x + 8y subject to x + y >= 3, x >= 0, y >= 0maximise P = 5x + 2y subject to 5x + 6y <= 21, x + 2y <= 3, x >= 0, y >= 0maximise P = 4x + 3y subject to x + y <= 7, x >= 0, y >= 0, x <= 6minimise C = 2x + 7y subject to x + y >= 3, x >= 0, y >= 0
Answers
maximise P = 3x + 2y subject to x + y <= 10, x >= 0, y >= 0, x <= 6Show the working
- Objective and constraints
- Corner points of the feasible regionThe best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
- Value of the objective at each corner
- Check: no other feasible point does better
minimise C = 2x + 5y subject to x + y >= 4, x >= 0, y >= 0Show the working
- Objective and constraints
- Corner points of the feasible regionThe best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
- Value of the objective at each corner
- Check: no other feasible point does better
maximise P = 5x + 4y subject to 6x + 4y <= 24, x + 2y <= 6, x >= 0, y >= 0Show the working
- Objective and constraints
- Corner points of the feasible regionThe best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
- Value of the objective at each corner
- Check: no other feasible point does better
minimise C = 2x + 4y subject to x + y >= 2, x >= 0, y >= 0Show the working
- Objective and constraints
- Corner points of the feasible regionThe best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
- Value of the objective at each corner
- Check: no other feasible point does better
maximise P = 2x + 6y subject to 8x + 4y <= 27, x + 2y <= 5, x >= 0, y >= 0Show the working
- Objective and constraints
- Corner points of the feasible regionThe best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
- Value of the objective at each corner
- Check: no other feasible point does better
maximise P = 4x + 2y subject to x + y <= 10, x >= 0, y >= 0, x <= 7Show the working
- Objective and constraints
- Corner points of the feasible regionThe best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
- Value of the objective at each corner
- Check: no other feasible point does better
minimise C = 2x + 8y subject to x + y >= 3, x >= 0, y >= 0Show the working
- Objective and constraints
- Corner points of the feasible regionThe best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
- Value of the objective at each corner
- Check: no other feasible point does better
maximise P = 5x + 2y subject to 5x + 6y <= 21, x + 2y <= 3, x >= 0, y >= 0Show the working
- Objective and constraints
- Corner points of the feasible regionThe best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
- Value of the objective at each corner
- Check: no other feasible point does better
maximise P = 4x + 3y subject to x + y <= 7, x >= 0, y >= 0, x <= 6Show the working
- Objective and constraints
- Corner points of the feasible regionThe best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
- Value of the objective at each corner
- Check: no other feasible point does better
minimise C = 2x + 7y subject to x + y >= 3, x >= 0, y >= 0Show the working
- Objective and constraints
- Corner points of the feasible regionThe best value of a linear objective always occurs at a corner. Corners are where two boundary lines meet and every constraint holds.
- Value of the objective at each corner
- Check: no other feasible point does better
Learn the method: Linear programming calculator solver and worked examples. All worksheets: worksheet index.