Solve the following linear program using the simplex method. If the problem is two dimensional, graph the feasible region, and outline the progress of the algorithm.
Minimize Z = 3X1 – 2X2 – X3
Subject to 4X1 + 5X2 – 2X3 ≤ 22
X1 – 2X2 + X3 ≤ 30
X1, X2, X3 ≥ 0
Get Answers For Free
Most questions answered within 1 hours.