Abstract:To solve a linear programming with the dual simplex algorithm,it is necessary to find a primal regular solution.To avoid introduce the artificial restriction,in the essay,the author employed the varia...To solve a linear programming with the dual simplex algorithm,it is necessary to find a primal regular solution.To avoid introduce the artificial restriction,in the essay,the author employed the variable replacement and provided a two-phase method of dual simplex in which the number of variable was not added.Read More
Publication Year: 2006
Publication Date: 2006-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