Steply

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

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

Step by step

The question

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

maximize P = 3x + 2y

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

x and y must follow every rule.

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

1 Draw the lines

A grid for x and y.

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

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

Solid: "or equal to".

The edge of x ≤ 4: the line x = 4, 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 = 3(0) + 2(0) = 0

At (0, 6): P = 12.

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

At (4, 0): P = 12.

(4, 0): P = 3(4) + 2(0) = 12

At (4, 2): P = 16.

(4, 2): P = 3(4) + 2(2) = 16

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 16, at x = 4, y = 2.

maximum P = 16 at (4, 2)

6 Check

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

That is less than 16.

So the corner is the best!

inside: (2, 2): P = 10 < 16

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 = 16 at (4, 2)

Your turn

Try this one yourself, then check:

maximize P = 5x + 4y
Show the answer
maximum P = 28 at (4, 2)

More from Linear programming

The whole lesson: Linear programming →