Operations Research010 marksNumerical: LPP simplex methodSimplex method for solving LPP
Solve the given Linear Programming Problem (LPP) by using simplex method and interpret the results. **Maximize:** Z = 10X1 + 20X2 **Subject to:**
Solve the given Linear Programming Problem (LPP) by using simplex method and interpret the results.
Maximize: $Z = 10X_1 + 20X_2$
Subject to: $$4X_1 + 2X_2 \leq 60$$ $$4X_1 + 10X_2 \leq 100$$ $$2X_1 + 3X_2 \leq 38$$ $$X_1, X_2 \geq 0$$
[10]
Maximize: $Z = 10X1 + 20X2$ Subject to: - $4X1 + 2X2 \leq 60$ - $4X1 + 10X2 \leq 100$ - $2X1 + 3X2 \leq 38$ - $X1, X2 \geq 0$ Add slack variables $S1, S2, S3$: - $4X1 + 2X2 + S1 = 60$ - $4X1 + 10X2 + S2 = 100$ - $2X1 + 3X2 + S3 = 38$ $Z = 10X1 + 20X2 + 0S1 + 0S2 + 0S3$ Basis X₁ X₂ S₁ S₂ S₃ RHS --...