A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
From MaRDI portal
Publication:2571997
DOI10.1016/j.amc.2004.10.078zbMath1082.65059OpenAlexW1981806178MaRDI QIDQ2571997
Hossein Arsham, T. Damij, Janez Grad, G. Cimperman, 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
linear programmingcomparison of methodsnumerical examplessimplex methodbasic variable setsimplex tableau reductioncomparison analysisreduction of artificial variables
Related Items (4)
A computationally stable solution algorithm for linear programs ⋮ Three nearly scaling-invariant versions of an exterior point algorithm for linear programming ⋮ Robust identification of enzymatic nonlinear dynamical systems for 1,3-propanediol transport mechanisms in microbial batch culture ⋮ Exterior point simplex-type algorithms for linear and network optimization problems
Uses Software
Cites Work
- Affine geometric method for linear programs
- An algorithm for simplex tableau reduction: The push-to-pull solution strategy
- \(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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
