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

Step-by-step explanation:

follow me and Mark me as brainlist..........