An algorithm for simplex tableau reduction: The push-to-pull solution strategy
From MaRDI portal
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
- 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?)
- 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.
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
Cited in
(5)- scientific article; zbMATH DE number 1931454 (Why is no real title available?)
- A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
- An improved initial basis for the simplex algorithm
- scientific article; zbMATH DE number 1786135 (Why is no real title available?)
- A computationally stable solution algorithm for linear programs
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)