Use the Simplex Tableau Method to solve the following linear programming problem.
Maximise z=5x1 + 3x2
subject to:
4x1 + 2x2 <= 15
4x1 + x2 <= 10
x1 + x2 <=4
and xj >= 0, j =1,2.
Use the optimal tableau above to answer the following.
i) State the maximum value of z.
ii) State the values of all the basic variables at the optimal point.
iii) Write the objective function in terms of the non-basic variables.
iv) Write each of the basic variables in terms of the non-basic variables.
v) At the optimal point, which of the three constraints are active and which are inactive. Justify your answer.
An operations research problem is solved using a simplex tableau.