Consider the following linear programming problem.
Maximize
P = 3x + 9y
subject to the constraints
3x + 8y ≤ 1
4x − 5y ≤ 4
2x + 7y ≤ 6
x ≥ 0, y ≥ 0
Write the initial simplex tableau.
x | y | s1 | s2 | s3 | P | Constant |
1 | ||||||
4 | ||||||
6 | ||||||
0 |
Get Answers For Free
Most questions answered within 1 hours.