Abstract:Presents an expanded simplex method of directly solving a linear programming problem to which the basic solution is neither a feasible solution to the primal problem nor a feasible solution to the dua...Presents an expanded simplex method of directly solving a linear programming problem to which the basic solution is neither a feasible solution to the primal problem nor a feasible solution to the dual problem.Read More
Publication Year: 2000
Publication Date: 2000-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