Title: A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
Abstract:This paper presents a simplex algorithm for finding a nonnegative solution (or demonstrating the inconsistency) of y = a + Ax where A is positive semi-definite. Linear and quadratic programming proble...This paper presents a simplex algorithm for finding a nonnegative solution (or demonstrating the inconsistency) of y = a + Ax where A is positive semi-definite. Linear and quadratic programming problems are of this form. The function exhibited in the proof of finiteness does not appear in other algorithms. If a primal feasible solution is available in the linear programming case, the actual choice of pivot rows is exactly that made in the usual lexicographic simplex method.Read More
Publication Year: 1967
Publication Date: 1967-06-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 71
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot