A Z-simplex algorithm with partial updates

DOI10.1007/BF01937354zbMath0635.90055OpenAlexW2042967452MaRDI QIDQ1097835

Adi Ben-Israel

Publication date: 1987

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01937354

zbMATH Keywords

canonical basespartial updatesY-dualZ-simplex algorithm

Mathematics Subject Classification ID

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

Related Items (1)

Canonical bases in linear programming

Cites Work

• The generalized simplex method for minimizing a linear form under linear inequality restraints
• A practicable steepest-edge simplex algorithm
• A class of methods for linear programming
• Large-scale linearly constrained optimization
• New Finite Pivoting Rules for the Simplex Method
• Sparse Matrix Methods in Optimization
• Stationary points of quadratic functions under linear constraints
• Optimality and Degeneracy in Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Z-simplex algorithm with partial updates