Operations Research208010 marksNumerical: Simplex method LPPSimplex method for solving LPP
Solve the given linear programming problem (LPP) by using simplex method and interpret the findings. Maximize Z = 4A+3B+6C Subject to Constraints: 2A+3B+2C leq 440 4A+3C leq 470 2A+5B leq 430 A,B,C geq 0
Solve the given linear programming problem (LPP) by using simplex method and interpret the findings.
Maximize Z = $4A+3B+6C$
Subject to Constraints:
$2A+3B+2C \leq 440$
$4A+3C \leq 470$
$2A+5B \leq 430$
$A,B,C \geq 0$
[10]
Objective: Maximize $Z = 4A + 3B + 6C$ Constraints: - $2A + 3B + 2C \le 440$ - $4A + 0B + 3C \le 470$ - $2A + 5B + 0C \le 430$ - $A, B, C \ge 0$ Add slack variables $s1, s2, s3$: - $2A + 3B + 2C + s1 = 440$ - $4A + 0B + 3C + s2 = 470$ - $2A + 5B + 0C + s3 = 430$ Maximize