Consider the following LP problem:

Minimize Cost = 3x₁ + 2x₂

s.t.

1x₁ + 2x₂ 12

2x₁ + 3 x₂ = 12

2 x₁ + x₂ 8

x₁ 0,

x₂ 0

A) What is the optimal solution of this LP? Give an explanation.

(4,0)

(2,3)

(0,8)

(0,4)

(0,6)

(3,2)

(12,0)

B)Which of the following statements are correct for a linear programming which is feasible and not unbounded?

1)All of the above.

2)Only extreme points may be optimal.

3)One of the extreme points must be optimal.

4)None of the above.

Only one extreme point must be optimal