5 Practice Questions on Linear Programming (Part 2)

6.         Solve the following maximization LPP by the simplex method

Maximize       Z = 2000 x₁+ 1800 x₂           Subject to:    x₁+ x₂  \< 10

1000 x₁+ 800 x₂ \< 9000

x1, x2 ≥ 0

7.         Using simplex method to solve the following LPP

Maximize       Z = 3x₁ + 4x₂                                  Subject to:     2x₁ \< 10,

3x_{2 \<} 12,

x₁, x₂ >/ 0

8.         Using simplex method to solve the following LPP

Maximize       Z = 15x₁ + 30x₂                            Subject to:     4x₁ + 5x_{2 \<} 200

2x₁ + 4x_{2 \<} 240

x₁ \< 40

x₂ \< 28

x₁, x₂ >/ 0

9.         Using simplex method to solve the following LPP

Maximize       Z = 50x₁ + 70x₂                            Subject to:     120x₁ + 120x_{2 \<} 8400

30x₁ + 60x_{2 \<} 3000

80x₁ + 40x_{2 \<}4800

x₁, x₂ >/0

10.       A business problem is formulated and expresses below as LPP. Solve it by simplex
method.

Maximize       Z = X₁ + X₂                                      Subject to:     8x₁ + X_{2 \<} 200

X₁ + 2X_{2 \<} 100

x₁, x₂ >/0