The implicit LX method of the ABS class

DOI10.1080/10556789708805669zbMath0894.90111OpenAlexW1971528556MaRDI QIDQ4380561

Emilio Spedicato, Zun-Quan Xia, Li-wei Zhang

Publication date: 7 September 1998

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789708805669

zbMATH Keywords

simplex algorithmABS classnonsingular linear systemimplicit LU algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (7)

Real and Integer Extended Rank Reduction Formulas and Matrix Decompositions: A Review ⋮ ABS methods for continuous and integer linear equations and optimization ⋮ Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms ⋮ Extended rank reduction formulas containing Wedderburn and Abaffy-Broyden-Spedicato rank reducing processes ⋮ ABS-type methods for solving full row rank linear systems using a new rank two update ⋮ ABS algorithms for Diophantine linear equations and integer LP problems ⋮ Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review

Cites Work

• Unnamed Item
• Steepest-edge simplex algorithms for linear programming
• Basic Matrices
• A Class of Methods for Solving Nonlinear Simultaneous Equations

This page was built for publication: The implicit LX method of the ABS class