Techniques for automatic tolerance control in linear programming
From MaRDI portal
Publication:5558281
DOI10.1145/365876.365909zbMath0171.38302OpenAlexW1995174206MaRDI QIDQ5558281
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
Related Items (9)
A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Round-off estimates for second-order conic feasibility problems ⋮ Comparison of two pivotal strategies in sparse plane rotations ⋮ Solving linear programs with finite precision. II: Algorithms ⋮ Spike swapping in basis reinversion ⋮ A stabilization of the simplex method ⋮ Interval arithmetic for guaranteed bounds in linear programming ⋮ Structural analysis by matrix decomposition ⋮ Error control in the simplex-technique
This page was built for publication: Techniques for automatic tolerance control in linear programming
