Share
Explore BrainMass

LP using simplex method

Problem:
Maximize: P= X1 + 2X2 +X3

Subject to constraints
3x1 + x2 + x3 <= 3
x1 - 10x2 - 4x3 <=20

x1>= 0 x2>=0 x3 >=0

Solution Summary

The solution solves a maximization problem using simplex method.

$2.19