(2 points) Compute the simplex tableau corresponding to initial basis = { x₁, x₂, x₃} and then perform the simplex iteration; i.e., the column of the most negative reduced cost enters into basis.

min 3 x₁ + 2 x₂ + 5 x₃ + 8 x₄,

s t 2 x₂ + 3 x₃ x₅ = 6,

4 x₁ + 2 x₂ + 2 x₃ + 4 x₄ x₆ = 10,

x₁ + 4 x₂ + 2 x₃ + 5 x₄ x₇ = 8,

x₁, x₂, x₃, x₄, x_5, x_6, x₇ 0.

Coefficient Matrix

	x1	x2	x3	x4	x5	x6	x7	min
0th row									ratio
1st row
2nd row
3rd row

2-2 (Continued)

The Simplex Tableau with respect to initial basis B⁰ = { x₁, x₂, x₃}

	x1	x2	x3	x4	x5	x6	x7	min
0th row									ratio
1st row
2nd row
3rd row

What is the objective value? What is the basic feasible solution? Is the basis optimal?

The Simplex Tableau with respect to B¹ = { }.

	x1	x2	x3	x4	x5	x6	x7	min
0th row									ratio
1st row
2nd row
3rd row

What is the objective value? What is the basic feasible solution? Is the basis optimal?