Given the following initial simplex tableau (Maximization problem) Consider the following initial simplex tableau (Maximization Problem).

	x1 84	x2 8	x3 165	s1 0	s2 0	s3 0	RHS
Basis	cB
s1		3	0	5	1	0	0	80
		9	1	20	0	3	0	250
		2	0	2	0	2	1	20
zj	12	0	160	0 0	-24	0 0
cj - zj

1. Fill in the missing values.

2.What variables form the basis?

3. What are the current values of the decision variables?

4. What is the current value of the objective function?

5. Which variable will enter the basis and what will its value be (after entering the basis).

6. Which variable will leave the basis and what will be its value after leaving the basis.