Title: An improved algorithm of simplex method in linear programming problem
Abstract:Aim To decrease the calculation amount and storage space of computer when simple method is used to solute linear programming problem.Methods Base on the idea of Gauss elimination of linear equations a...Aim To decrease the calculation amount and storage space of computer when simple method is used to solute linear programming problem.Methods Base on the idea of Gauss elimination of linear equations and trying method,establishes a new simplex method with no artificial base input.Results A new simplex method is established,and a particular analysis is given for the algorithm.Conclusion The improved algorithm can avoid cycling which exist in the simplex method.Numerical tests show that the improved algorithm is more efficient than the simplex method.Read More
Publication Year: 2007
Publication Date: 2007-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot