An algorithm for simplex tableau reduction: The push-to-pull solution strategy

DOI10.1016/S0096-3003(02)00157-1zbMath1030.65063OpenAlexW1987729476MaRDI QIDQ1406107

T. Damij, Janez Grad, Hossein Arsham

Publication date: 9 September 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(02)00157-1

zbMATH Keywords

algorithmlinear programmingnumerical examplesbasic variable setadvanced basicsimplex tableau reduction

Mathematics Subject Classification ID

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

Related Items (3)

A computationally stable solution algorithm for linear programs ⋮ An improved initial basis for the simplex algorithm ⋮ A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method

Uses Software

• MarPlex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Affine geometric method for linear programs
• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
• Finite element modelling of distribution problems.
• Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
• Distribution-routes stability analysis of the transportation problem
• A comparison of the primal‐simplex and complementary pivot methods for linear programming
• Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods

This page was built for publication: An algorithm for simplex tableau reduction: The push-to-pull solution strategy