6.        Solve the following maximization LPP by the simplex method
Maximize      Z = 2000 x1+ 1800 x2          Subject to:   x1+ x2 \< 10
1000 x1+ 800 x2Â \< 9000
x1, x2 ≥ 0
7.        Using simplex method to solve the following LPP
Maximize      Z = 3x1 + 4x2                                 Subject to:    2x1 \< 10,
3x2 \<Â 12,
x1, x2Â >/ 0
8.        Using simplex method to solve the following LPP
Maximize      Z = 15x1 + 30x2                           Subject to:    4x1 + 5x2 \< 200
2x1 + 4x2 \<Â 240
x1Â \< 40
x2Â \< 28
x1, x2Â >/ 0
9.        Using simplex method to solve the following LPP
Maximize      Z = 50x1 + 70x2                           Subject to:    120x1 + 120x2 \< 8400
30x1 + 60x2 \<Â 3000
80x1 + 40x2 \<4800
x1, x2Â >/0
10.     A business problem is formulated and expresses below as LPP. Solve it by simplex
method.
Maximize      Z = X1 + X2                                     Subject to:    8x1 + X2 \< 200
X1 + 2X2 \<Â 100
x1, x2Â >/0
59 Comments