Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage

DOI10.1007/BF02591939zbMath0559.90050OpenAlexW2078442325MaRDI QIDQ5184664

Michael Bastian

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

implicit constraintsfactored inversesForrest-Tomlin data structuregeneralized variable upper boundinverse of the working basis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Cites Work

• An implementation of the simplex method for linear programming problems with variable upper bounds
• Implicit representation of generalized variable upper bounds in linear programming
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Unnamed Item
• Unnamed Item

This page was built for publication: Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage