LP using simplex method
Not what you're looking for? Search our solutions OR ask your own Custom question.
Problem:
Maximize: P= X1 + 2X2 +X3
Subject to constraints
3x1 + x2 + x3 <= 3
x1 - 10x2 - 4x3 <=20
x1>= 0 x2>=0 x3 >=0
© BrainMass Inc. brainmass.com March 6, 2023, 1:09 pm ad1c9bdddfhttps://brainmass.com/math/linear-programming/lp-using-simplex-method-4566
Solution Summary
The solution solves a maximization problem using simplex method.
$2.49