Steply

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

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

Step by step

The question

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

maximize P = 5x + 2y

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

x and y must follow every rule.

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

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 ≤ 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 = 5(0) + 2(0) = 0

At (0, 4): P = 8.

(0, 4): P = 5(0) + 2(4) = 8

At (3, 0): P = 15.

(3, 0): P = 5(3) + 2(0) = 15

At (3, 1): P = 17.

(3, 1): P = 5(3) + 2(1) = 17

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 17, at x = 3, y = 1.

maximum P = 17 at (3, 1)

6 Check

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

That is less than 17.

So the corner is the best!

inside: (1, 1): P = 7 < 17

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 = 17 at (3, 1)

Your turn

Try this one yourself, then check:

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

More from Linear programming

The whole lesson: Linear programming →