Operations Research2080.210 marksNumerical: Simplex method LPPSimplex method for solving LPP
Solve the given linear programming problem (LPP) by using simplex method and interpret the findings. Min Z = 20A+10B Subject to A+2B leq 40 4A+3B geq 60 3A+B geq 30 A,B geq 0
Solve the given linear programming problem (LPP) by using simplex method and interpret the findings.
Min Z = $20A+10B$
Subject to
$A+2B \leq 40$
$4A+3B \geq 60$
$3A+B \geq 30$
$A,B \geq 0$
[10]
Objective: Minimize $Z = 20A + 10B$ Constraints: - $A + 2B \leq 40$ - $4A + 3B \geq 60$ - $3A + B \geq 30$ - $A, B \geq 0$ Add slack $S1$ (for $\leq$), surplus $S2, S3$ and artificial $A1, A2$ (for $\geq$): - $A + 2B + S1 = 40$ - $4A + 3B - S2 + A1 = 60$ - $3A + B - S3 + A2 = 30$ $$\text{Min } Z ...