A comparison of the primal‐simplex and complementary pivot methods for linear programming

Arunachalam Ravindran

Naval Research Logistics Quarterly, 1973, vol. 20, issue 1, 95-100

Abstract: A comparison of the complementary pivot method of Lemke‐Howson and the more commonly used primal‐simplex method for solving linear programming problems in symmetric dual form has been made. In our tests the complementary pivot method shows a definite superiority over the simplex method both with regard to the number of iterations and computation time.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800200109

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:wly:navlog:v:20:y:1973:i:1:p:95-100

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().