we consider parallel simplex method and parallel conjugate gradient simplex method which improve parallel simplex method for linear Least-square problems. The algorithm can exert the character of parallel computer because they have parallel logic themselves.Under the 2-dimensional case
we also discuss the theory of the parallel simplex method.And we proof the convergence of the parallel algorithm.At last
We give some numerical examples to indicate that the new idea is sometimes useful and helpful.
京公网安备11010802024621