A comparison of the primal‐simplex and complementary pivot methods for linear programming
From MaRDI portal
Publication:5668237
DOI10.1002/nav.3800200109zbMath0254.90028OpenAlexW2028887049MaRDI QIDQ5668237
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
Related Items (9)
A computationally stable solution algorithm for linear programs ⋮ Variational Inequality and Complementarity Problem ⋮ An artificial-free simplex-type algorithm for general LP models ⋮ An algorithm for simplex tableau reduction: The push-to-pull solution strategy ⋮ Computer experiments on quadratic programming algorithms ⋮ A computational study of redundancy in randomly generated polytopes ⋮ An application of homotopy to solving linear programs ⋮ A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method ⋮ Über den Aufwand zur Lösung quadratischer Optimierungsprobleme mit den Algorithmen von Beale und von Lemke
Cites Work
This page was built for publication: A comparison of the primal‐simplex and complementary pivot methods for linear programming
