In: Advanced Math
For the following Linear Programming problem, use the Simplex Approach to construct the starting simplex tableau:
Maximize ???? = P = 4 X + 5 Y
Subjected to: 3 X + 5 Y ≤ 20
X + Y ≤ 6
X, Y ≥ 0
Then apply Gauss-Jordan computations to determine the new basic solution and find the Optimum Solution?