Consider the following linear program.

Max 1A + 2B
s.t.
	1A		4
	1B		3
	2A + 2B	=	10
	A, B 0

(a)

Show the feasible region.

The A B-coordinate plane is given.

• A line segment begins at the point (2, 3), goes down and right, and ends at the point (4, 1).
• The region is to the left of A = 4, and below B = 3.

The A B-coordinate plane is given. A line segment begins at the point (2, 3), goes down and right, and ends at the point (4, 1).

The A B-coordinate plane is given.

• A line segment begins at the point (2, 3), goes down and right, and ends at the point (4, 1).
• The region is below the line segment, to the left of A = 4, and below B = 3.

The A B-coordinate plane is given.

• A line segment begins at the point (2, 3), goes down and right, and ends at the point (4, 1).
• The region is above the line segment, to the left of A = 4, and below B = 3.

(b)

What are the extreme points of the feasible region?

smaller x-value

(A, B)

=

larger x-value

(A, B)

=

(c)

Find the optimal solution using the graphical procedure.

(A, B) =