In some linear program that is hard to find an initial feasible point, simplex method will fail in its phase one algorithm. But we can find such a feasible point through other method such as genetic algorithm: the problem is such solution may have many noise of small numbers for some coordinate. We want to use simplex to finish up such a solution that will eliminate those noise. But simplex method will not use the user provided x0. There is a proposed linear thansformation method to change the original problem so that 0 will be the original x0 and circumvent that restriction of simplex: https://scicomp.stackexchange.com/a/7699/4584. This method need additional work on reformate the problem. Is there more easy solution, such as modify a few lines of the code of simplexphaseone so that x0 will be used directly?
how to make linear program simplex method use user provided feasible initial point
linear programming