Simplex Algorithm
starting from a problem in bfs form
Choose a variable y with negative coefficient in the obj. func.
Find the equation x = b + cy + ... where cɘ and -b/c is minimal
Rewrite this equation with y the subject y = -b/c + 1/c x + ...
Substitute -b/c + 1/c x + ... for y in all other eqns and obj. func.
until no such variable y exists or no such equation exists
if no such y exists optimum is found
else there is no optimum solution