Simplex Method: Maximize & Minimize
Please see the attached file for full problem description.
Maximize Minimize
P=100x1 + 200x2 + 50x3 C=5x1 + 4x2 + 3x3
Subject to the constraints Subject to the constraints
5x1 + 5x2 + 10x3 < 1000 x1 + x2 + x3 > 100
10x1 + 8x2 + 5x3 < 2000 2x1 + x2 > 50
10x1 + 5x2 < 500 x1> 0 x2> 0 x3> 0
x1> 0 x2 > 0 x3> 0
https://brainmass.com/math/linear-programming/simplex-method-maximize-minimize-17727
Solution Summary
The simplex method is used to solve linear programming problems. All tableaux are shown.
$2.19