Question

Using dual Simplex method, solve the following

problem : 20

Maximize Z = 2x1 + 2x2 + 4x3

Subject to :

2x1 + 3x2 + 5x3  2

3x1 + x2 + 7x3  3

x1 + 4x2 + 6x3  5

x1, x2, x3  0​

Answer 1

Answer:

Subject to: 2x1 + 3x2 + x3 ≤. 5. 4x1 + x2 + 2x3 ≤ 11. 3x1 + 4x2 + 2x3 ≤. 8 x1,x2 ... to solve the auxiliary problem using the simplex method. ... 4x1 +x2 +5x3 +3x4 ≤ 4x1 +3x2 + 6x3 −3x4.

Step-by-step explanation:

I think it's help you