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

DOI10.1016/S0096-3003(02)00157-1MaRDI QIDQ1406107zbMATH OpenOpenAlexFDO

Authors T. Damij, H. Arsham, Janez Grad

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

advanced basicalgorithmbasic variable setlinear programmingnumerical examplessimplex tableau reduction

Mathematics Subject Classification ID

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

Review text

This paper proposes a new general solution algorithm. The algorithm consists of preliminaries, followed by two main phases. The first phase develops a basic variable set, the second phase pulls the solution back to feasibility. Both phases use the usual Gauss pivoting row operation. Some numerical examples illustrate different parts of the new solution algorithm. Also a computer implementation of the algorithm is given.

Recommendations

• scientific article; zbMATH DE number 1931454
• A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
• An artificial-free simplex-type algorithm for general LP models
• An overview on the simplex algorithm
• scientific article; zbMATH DE number 1786135

Cites work

• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
• A comparison of the primal‐simplex and complementary pivot methods for linear programming
• Affine geometric method for linear programs
• Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
• Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
• Distribution-routes stability analysis of the transportation problem
• Finite element modelling of distribution problems.
• scientific article; zbMATH DE number 412110 (Why is no real title available?)
• scientific article; zbMATH DE number 4135711 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 3283574 (Why is no real title available?)

Cited in

(6)

• An artificial-free simplex-type algorithm for general LP models
• 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
• scientific article; zbMATH DE number 1931454 (Why is no real title available?)
• scientific article; zbMATH DE number 1786135 (Why is no real title available?)

Describes a project that uses

Uses Software

• MarPlex

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

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