Solve the following linear programming problem graphically :
Minimize Z=13x−15y
Subject to constraints
x+y≤7,
2x−3y+6≥0,
x≥0,y≥0
Exam answer
Draw the lines (graph below):
x+y=7 through (7,0) and (0,7);
2x−3y+6=0 through (−3,0) and (0,2).
Why?
Each inequality is bounded by a straight line, found by writing "=" in place of the inequality sign. Two points fix a line, and the easiest are where it meets the axes.
For x+y=7:y=0 gives x=7, and x=0 gives y=7.
For 2x−3y+6=0:y=0 gives 2x=−6, so x=−3. And x=0 gives −3y=−6, so y=2.
At (0,0):0≤7 and 6≥0 are true, so shade the side of each line that contains the origin. With x,y≥0, the feasible region is OABC (shaded). It is bounded.
Why?
A line splits the plane into two sides, and an inequality holds on one whole side. Testing one point that is not on the line tells us which side. The origin is the easiest test point.
At (0,0):x+y=0, which is ≤7. And 2x−3y+6=6, which is ≥0.
x≥0,y≥0 keep us in the first quadrant. The feasible region is where all four conditions hold at once.
At B, putting x=7−y in 2x−3y=−6:14−5y=−6, so y=4 and x=3.
Why?
B is where the two lines cross, so its coordinates satisfy both equations. Solve them together.
From x+y=7,x=7−y. Then 2(7−y)−3y=14−5y, so −5y=−20 and y=4.
The second line 2x−3y+6=0 is the same as 2x−3y=−6. Then:
The feasible region OABC (shaded), drawn with equal scales. Its corners are O(0, 0), A(7, 0), B(3, 4) and C(0, 2).CornerO(0,0)A(7,0)B(3,4)C(0,2)Z=13x−15y091−21−30←minWhy?
Corner point method: if Z has a minimum on the feasible region, it occurs at a corner. So we only need Z at the corners:
Type 1. Find the maximum: lines, shading, corners, table
Spot it: "Maximise Z" with "≤" rules that have only plus signs, like x+2y≤10. The region is then a closed shape with a corner at the origin.
Here: Both rules, x+y≤7 and 2x−3y+6≥0, hold at (0,0), so shade the origin's side: a closed region OABC. Solve the two lines for B(3,4); since a minimum is asked, take the smallest value, −30 at (0,2).