A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method

DOI10.1016/J.AMC.2004.10.078MaRDI QIDQ2571997zbMATH OpenOpenAlexFDO

Authors H. Arsham, G. Cimperman, T. Damij, Janez Grad, Nadja Damij

Publication date 14 November 2005

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

Full work available at URL https://doi.org/10.1016/j.amc.2004.10.078

zbMATH Keywords

linear programmingnumerical examplescomparison of methodssimplex methodbasic variable setsimplex tableau reductioncomparison analysisreduction of artificial variables

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1931454
• New variant of artificial-free algorithm for linear programming
• An algorithm for linear programming that is easy to implement
• A method of solving the general problem of linear programming
• scientific article; zbMATH DE number 1445590
• scientific article; zbMATH DE number 1372544
• scientific article; zbMATH DE number 2000144
• A new method of avoiding artificial variables for achieving an initial feasible basis of a linear programming
• scientific article; zbMATH DE number 169279
• Publication:4502371

Cites work

• 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 3466805 (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?)
• A comparison of the primal‐simplex and complementary pivot methods for linear programming
• Affine geometric method for linear programs
• An algorithm for simplex tableau reduction: The push-to-pull solution strategy
• 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.
• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.

Cited in

(8)

• scientific article; zbMATH DE number 1931454 (Why is no real title available?)
• An algorithm for simplex tableau reduction: The push-to-pull solution strategy
• Robust identification of enzymatic nonlinear dynamical systems for 1,3-propanediol transport mechanisms in microbial batch culture
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
• Exterior point simplex-type algorithms for linear and network optimization problems
• On the efficient use of the architecture of a small computer for LP algorithms
• New variant of artificial-free algorithm for linear programming
• A computationally stable solution algorithm for linear programs

Describes a project that uses

Uses Software

• MarPlex

This page was built for publication: A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method

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