Share
Explore BrainMass

Linear Programming and Simplex Methods : Minimization based on Tableau

Consider the simplex tableau

x y u v w M
1 0 3 0 0 0 10
0 0 1 0 1 0 0
0 1 -6 0 0 0 3
0 0 8 1 0 0 7
0 0 5 0 0 1 4

The tableau above is the final one in a problem to minimize -x + 2y. The minimum value of -x + 2y occurs when:

a. x = 10, y =3
b. x = -10, y= -3
c. x = 10, y =0
d. x = -20, y= 6.
e. None of the above

Attachments

Solution Preview

Hello and thank you for posting your question to Brainmass!
The solution is attached below (next to ...

Solution Summary

Minimization based on a tableau is investigated. The solution is detailed and well presented.

$2.19