[3.49] The following is the current simplex tableau of a given maximization problem. The objective is to maximize 2x1 - 4x2, and the slack variables are x3 and x4. The constraints are of the ≤ type. z x1 x2 x3 x4 RHS z 1 b 1 f g 8 x3 0 c 0 1 1/5 4 x1 0 d e 0 2 a a. Find the unknowns a through g.b. Find B^-1.c. Find (∂ x3)/(∂ x2), (∂ z)/(∂ b1), (∂ z)/(∂ x4), (∂ x1)/(∂ b2).d. Is the tableau optimal?

In the tableau for the maximization problem below, the values o... | Filo

Answered: Solve the following linear programming maximization problem using Simplex Tableaue method. z = 4x - 3y Subject to the constraints: x + y ≤ 9 2x + y ≤ 13 x ≥… | bartleby