The simplex algorithm has been used to resolve the following problems, and the corresponding initial and...

Transcribed Image Text:

The simplex algorithm has been used to resolve the following problems, and the corresponding initial and final tableaux are given (with the w row omitted). For each, construct the dual, determine an optimal solution point to the dual using the data from the tableaux, and verify that your solution point is feasible and optimal. Minimize -2x1 +5x2 +9x3 subject to 2x2 + 5x3 2 1 X3 6 x3 = 3 3x1 X2 2x1 4x2 + X1, X2, X3 20 X6 x5 X7 X3 X2 XI XI 0 X2 -2 0 0 1 0 2 3 2 -4 5 0 1 0 0 X4 -1 0 0 0 -1/ 0 -1/2 0 0 X3 5 -1 1 9 1 -1/2 3 X5 01 1 0 x6 1 0 0 0 12 12 - X7 0 0 1 0 -1 - 20 1 1 6 3 0 TS 515 25 3333 2 The simplex algorithm has been used to resolve the following problems, and the corresponding initial and final tableaux are given (with the w row omitted). For each, construct the dual, determine an optimal solution point to the dual using the data from the tableaux, and verify that your solution point is feasible and optimal. Minimize -2x1 +5x2 +9x3 subject to 2x2 + 5x3 2 1 X3 6 x3 = 3 3x1 X2 2x1 4x2 + X1, X2, X3 20 X6 x5 X7 X3 X2 XI XI 0 X2 -2 0 0 1 0 2 3 2 -4 5 0 1 0 0 X4 -1 0 0 0 -1/ 0 -1/2 0 0 X3 5 -1 1 9 1 -1/2 3 X5 01 1 0 x6 1 0 0 0 12 12 - X7 0 0 1 0 -1 - 20 1 1 6 3 0 TS 515 25 3333 2

Answer rating: 100% (QA)

To construct the dual problem we can use the tableaux given and convert the primal problem into stan... View the full answer