Abstract:Our paper presents a new Criss-Cross method for solving linear programming problems. Starting from a neither primal nor dual feasible solution, we reach an optimal solution in finite number of steps i...Our paper presents a new Criss-Cross method for solving linear programming problems. Starting from a neither primal nor dual feasible solution, we reach an optimal solution in finite number of steps if it exists. If there is no optimal solution, then we show that there is not primal feasible or dual feasible solution, We prove the finiteness of this procedure. Our procedure is not the same as the primal or dual simplex method if we have a primal or dual feasible solution, so we have constructed a quite new procedure for solving linear programming problems.Read More
Publication Year: 1985
Publication Date: 1985-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 85
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot