LPP Simplex Method: Maximization Problem

Use the simplex method to find the maximum value of

Z=3x1+2x2+x3

Subject to the constraints:

4x1 +x2+x3       ≤   30

2x1 + 3x2   +   x3 ≤ 60

2x1 +2x2 + 3x3   ≤   40

simplex-maximize-1 simplex-maximize-1