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

DOI10.1002/NAV.3800200109MaRDI QIDQ5668237zbMATH OpenOpenAlexFDO

Authors A. Ravindran

Publication date 1973

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800200109

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites work

• Bimatrix Equilibrium Points and Mathematical Programming

Cited in

(9)

• Computer experiments on quadratic programming algorithms
• A computational study of redundancy in randomly generated polytopes
• An artificial-free simplex-type algorithm for general LP models
• An algorithm for simplex tableau reduction: The push-to-pull solution strategy
• A computationally stable solution algorithm for linear programs
• A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
• Variational inequality and complementarity problem
• An application of homotopy to solving linear programs
• Über den Aufwand zur Lösung quadratischer Optimierungsprobleme mit den Algorithmen von Beale und von Lemke

This page was built for publication: A comparison of the primal‐simplex and complementary pivot methods for linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5668237)