A linear programming problem asks for the greatest (or least) value of an expression like P=ax+by when x and y must satisfy several linear inequalities.
The feasible region
Draw each boundary line, then keep the side that satisfies the inequality (see inequalities↺). Test a point that is not on the line, such as the origin. The region that satisfies all of them at once is the feasible region.
The corner-point method
The greatest and least values of ax+by over the region always occur at a corner. So:
find the corners, by solving the equations of the lines that meet there;
work out ax+by at each corner;
pick the largest (or smallest).
The best point is a cornerSlide the line ax + by = k out: it leaves the region at a corner
The corner-point methodSet the coefficients of P = ax + by
20greatest P(4, 4)at
P = 2x + 3y at the corners: (0, 0) → 0; (6, 0) → 12; (5, 3) → 19; (4, 4) → 20; (0, 6) → 18. The greatest is 20, at (4, 4).
Indicate by shading graphically the set of all points P(x,y) in the Oxy plane that satisfy simultaneously the inequalities 2x−y≥−4, x+y≤10, y−x>0, y≥2 and x≥0.
Model answer
Draw each boundary line, then shade the side that satisfies every inequality. The region R has corners (5,5), (2,8), (0,4), (0,2), (2,2). The line y=x is dashed because y−x>0 is strict (points on it are not included). WAEC accepts either shading the wanted region or shading the unwanted side, as long as you label the region clearly.
For (b): check 10x+5y at each corner; the largest value, 75, is at (5,5).
(b)
Using the graph, find the values of x and y for which 10x+5y is maximum.
Try it on a graph
The feasible region; test the corners in 10x + 5y.
Worked solution (try it first)
(a)
Draw 2x−y=−4, x+y=10, y=x (dashed, since y−x>0), y=2 and x=0, and shade the region that satisfies all five.