According to the Wikipedia article, the Simplex algorithm depends on constraining all the unknowns to be >= 0. I have a problem where one of my variables is highly likely to be negative in many cases. How can I adapt the problem so I can use Simplex?
EDIT: example: say I have x, y and z and I want to find values (both >= 0) for x and y which minimize z, where I also have the constraints:
1.4x -y +z >= 0 -x +2.2y +z >= 0