Linear Programming grapher, or use the newer version. Click on Show LP Example to see how to enter an example, change this to enter your own problem and then choose Solve for a solution. Note you can also show the graph.
This Simplex Method tool works in a similar way – again choose Example to see how to enter the problem.
See also:
Decision Maths – Teaching Resources
Linear Programming, a page which includes further tools for solving Linear Programming problems.
This A Level question from the MEI Decision 1 Legacy Specimen Paper is included, with solutions illustrated on various tools.
A vet is treating a farm animal. He must provide minimum daily requirements of an antibiotic, a vitamin and a nutrient. He has two types of medicine available, tablets and liquid. The table summarises what the medicines contain and the requirements.
The tablets cost £0.38 each and liquid medicine costs £1 per dose.
The vet wants to find the cheapest way to treat the animal.
We have x as the number of tablets which the vet prescribes per day, and y is the number of doses of liquid medicine, giving us the linear programming problem:
Minimise 0.38x + y
Subject to
3x + 2y ≥ 18
2x + 4y ≥ 16
10x + 50y ≥ 100
