A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming

Robert L. Graves
Additional contact information
Robert L. Graves: University of Chicago, Chicago, Illinois

Operations Research, 1967, vol. 15, issue 3, 482-494

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 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.

Date: 1967
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.3.482 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:15:y:1967:i:3:p:482-494

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().