Steply

Maximize P = 2x + y: x ≥ 0, y ≥ 0, x + y ≤ 5, x ≤ 3

Step by step, with the reason for every step · Linear programming · Algebra 1

Step by step

The question

Question: maximize P = 2x + y, when x ≥ 0, y ≥ 0, x + y ≤ 5, x ≤ 3.

maximize P = 2x + y

Maximize means: make P as big as it can be.

x and y must follow every rule.

= x ≥ 0, y ≥ 0, x + y ≤ 5, x ≤ 3

1 Draw the lines

A grid for x and y.

The edge of x + y ≤ 5 is the line x + y = 5.

It crosses the axes at (5, 0) and (0, 5).

Solid: "or equal to".

The edge of x ≤ 3: the line x = 3, straight up.

2 Shade the region

x ≥ 0 and y ≥ 0: right of the y-axis, above the x-axis.

"Less than or equal": the side of each line with (0, 0).

The shaded part fits every rule.

3 Find the corners

The corners are where two edges of the region meet.

4 Test each corner

At (0, 0): P = 0.

(0, 0): P = 2(0) + 1(0) = 0

At (0, 5): P = 5.

(0, 5): P = 2(0) + 1(5) = 5

At (3, 0): P = 6.

(3, 0): P = 2(3) + 1(0) = 6

At (3, 2): P = 8.

(3, 2): P = 2(3) + 1(2) = 8

Careful!

The biggest value is always at a corner of the shaded region.

So we only test the corners.

Careful: the best point is always a corner of the region

5 Pick the best

The biggest is 8, at x = 3, y = 2.

maximum P = 8 at (3, 2)

6 Check

Let's check with a point inside the region, (1, 1): P is 3.

That is less than 8.

So the corner is the best!

inside: (1, 1): P = 3 < 8

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.

Answer
maximum P = 8 at (3, 2)

Your turn

Try this one yourself, then check:

maximize P = 3x + y
Show the answer
maximum P = 11 at (3, 2)

More from Linear programming

The whole lesson: Linear programming →