Consider the following LP model:

Minimize z = 2x1 + x2

Subject to

3x1 + x2 - x3 = 3

4x1 + 3x2 - x4 = 6

X1 + 2x2 + x5 = 3

X1, x2, x3, x4, x5 ≥ 0

Compute the entire simplex tableau associated with the following basic solution and check it for optimality and feasibility.

Basic variables = (x₁, x₂, x₅), Inverse = 

Transcribed Image Text:

-1 प