Use simplex method to solve the LPP

Max Z = 3xj + 2x2 + 5x3

subject to the constraints x1 + 4x2 ≤ 420

3x1 + 2x3 ≤ 460

x1 + 2x2 + x3 ≤ 430

x, X2, 75 = 0.

asked by guest
on Nov 25, 2024 at 5:22 pm



Mathbot Says...

I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.


+ Submit Question