Operations Research207910 marksNumerical: LPP simplex methodSimplex method for solving LPP
Solve the given Linear Programming Problem (LPP) by using simplex method and interpret the results. Minimize Z = 25A + 10B subject to constraints: Where A, B leq 0
Solve the given Linear Programming Problem (LPP) by using simplex method and interpret the results.
Minimize $Z = 25A + 10B$
subject to constraints:
$$\begin{aligned} A + B &= 50 \ A &\geq 20 \ B &\leq 40 \end{aligned}$$
Where $A, B \leq 0$
[10]
Objective: Minimize $Z = 25A + 10B$ Constraints: - $A + B = 50$ - $A \geq 20$ - $B \leq 40$ - $A, B \geq 0$ (the problem statement writes "$\leq 0$" which is inconsistent with a meaningful minimization; standard non-negativity $A, B \geq 0$ is assumed as the intended condition) --- Introduce surp...