Explore BrainMass

Linear Programming Problem - Simplex Method

Solve the following linear program either by hand using the simplex procedure or by using excel solver.

Maximize P = 3X1 + 2X2
Subject to 10X1 + 2X2 ≤ 20
X1 + X2 ≤ 6
where X1, X2 ≥ 0

Solution Summary

All Simplex tableaus are shown leading to the optimum solution.