Maximise Z = 5x + 3y subject to x + y ≤ 8, x ≤ 6, x ≥ 0 and y ≥ 0…
Contributed by StemPy LabTry it on paper first. A hint, the key idea and the worked solution are here when you need them.
Maximise subject to , , and . Find the corner points, work out at each, and say where the maximum occurs.
Need a reminder? The key ideaShow
For a bounded feasible region, work out at every corner point. The largest value is the maximum and the smallest value is the minimum. State the best point as well as the best value.
The worked solution
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The corners. The line meets where . So the corners are , , and .
Step 2. The values. At , . At , . At , . At , .
Step 3. Compare. The largest value is , at .
Answer: the maximum of is at , .
More onAlgebra › Linear Programming
Discussion (0)
Log in to join the discussion.
Loading…