A new polynomial-time algorithm for linear programming
Combinatorica
Linear optimization and extensions: theory and algorithms
Linear optimization and extensions: theory and algorithms
A family of search directions for Karmarkar's algorithm
Operations Research
Combining interior-point and pivoting algorithms for linear programming
Management Science
Comments on "an efficient search direction for linear programming problems" by H. Luh and R. Tsaih
Computers and Operations Research
An improved intial basis for the simplex algorithm
Computers and Operations Research
On auxiliary algorithm for the simplex method by h. luh and r. tsaih
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Hi-index | 0.01 |
In this paper, we present an auxiliary algorithm, in terms of the speed of obtaining the optimal solution, that is effective in helping the simplex method for commencing a better initial basic feasible solution. The idea of choosing a direction towards an optimal point presented in this paper is new and easily implemented. From our experiments, the algorithm will release a corner point of the feasible region within few iterative steps, independent of the starting point. The computational results show that after the auxiliary algorithm is adopted as phase I process, the simplex method consistently reduce the number of required iterations by about 40%.