Techniques for automatic tolerance control in linear programming

DOI10.1145/365876.365909MaRDI QIDQ5558281zbMATH OpenOpenAlexFDO

Authors Richard J. Clasen

Publication date 1966

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/365876.365909

zbMATH Keywords

numerical analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cited in

(9)

• A survey of the advances in the exploitation of the sparsity in the solution of large problems
• Comparison of two pivotal strategies in sparse plane rotations
• Solving linear programs with finite precision. II: Algorithms
• A stabilization of the simplex method
• Interval arithmetic for guaranteed bounds in linear programming
• Structural analysis by matrix decomposition
• Spike swapping in basis reinversion
• Round-off estimates for second-order conic feasibility problems
• Error control in the simplex-technique

This page was built for publication: Techniques for automatic tolerance control in linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5558281)