Step by step
The question
Question: minimize C = 2x + 3y, when x ≥ 0, y ≥ 0, x + y ≥ 4, x + 3y ≥ 6.
Minimize means: make C as small as it can be.
x and y must follow every rule.
1 Draw the lines
A grid for x and y.
The edge of x + y ≥ 4 is the line x + y = 4.
It crosses the axes at (4, 0) and (0, 4).
Solid: "or equal to".
The edge of x + 3y ≥ 6 is the line x + 3y = 6.
It crosses the axes at (6, 0) and (0, 2).
Solid: "or equal to".
2 Shade the region
x ≥ 0 and y ≥ 0: right of the y-axis, above the x-axis.
"Greater than or equal": the side away from (0, 0).
The shaded part fits every rule.
3 Find the corners
The corners are where two edges of the region meet.
Where x + y = 4 meets x + 3y = 6: we solve the two together, as in the systems lesson.
x = 3, y = 1.
4 Test each corner
At (0, 4): C = 12.
At (6, 0): C = 12.
At (3, 1): C = 9.
Careful!
The smallest value is always at a corner of the shaded region.
So we only test the corners.
5 Pick the best
The smallest is 9, at x = 3, y = 1.
6 Check
Let's check with a point inside the region, (4, 2): C is 14.
That is more than 9.
So the corner is the best!
Let's look back.
First: draw the lines.
Then: shade the region.
Then: find the corners.
Then: test each corner.
Then: pick the best.
Last: check.