Question 4 Consider o LPP Maximize Z=2x_1+2x_2+x_3-3X_4 subject to 3x_1+x_2 - x_4 ≤1 x_1+x_2+x_3+x_4≤2 -3x_1+2x_3 +5x_
Posted: Wed Jul 06, 2022 12:04 pm
Question 4 Consider o LPP Maximize Z=2x_1+2x_2+x_3-3X_4
subject to
3x_1+x_2 - x_4 ≤1x_1+x_2+x_3+x_4≤2 -3x_1+2x_3 +5x_4≤6
X_1, X_2, X_3,X_4, X_5, X_6, X_7≤0 Adding the slack variables and applying Simplex we arrive at the following final tableau.
4.1-Write the dual (D) of the problem (P) 4.2 Without solving (D), use tableau simplex and find the solution of (D)4.3- Determine B^(-1)4.4-Suppose that a change in vector b (resources) was necessary for [324]. The previous viable solution? Case remains optimal negative, use the Dual Simplex Method to restore viability
X1 -2 X3 X2 3 X₁ 1 2 N X2 0 1 0 0 X3 1 0 0 0 X4 2 -1 1 3 X5 1 2 1 X6 X7 1 0 0 0 -2 1 1 0 sbv 1 1 4. 03
subject to
3x_1+x_2 - x_4 ≤1x_1+x_2+x_3+x_4≤2 -3x_1+2x_3 +5x_4≤6
X_1, X_2, X_3,X_4, X_5, X_6, X_7≤0 Adding the slack variables and applying Simplex we arrive at the following final tableau.
- Question 4 Consider O Lpp Maximize Z 2x 1 2x 2 X 3 3x 4 Subject To 3x 1 X 2 X 4 1 X 1 X 2 X 3 X 4 2 3x 1 2x 3 5x 1 (33.12 KiB) Viewed 14 times
X1 -2 X3 X2 3 X₁ 1 2 N X2 0 1 0 0 X3 1 0 0 0 X4 2 -1 1 3 X5 1 2 1 X6 X7 1 0 0 0 -2 1 1 0 sbv 1 1 4. 03