Approximations to Solutions to Systems of Linear Inequalities
- 1 April 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 16 (2), 688-696
- https://doi.org/10.1137/s0895479892237744
Abstract
In this paper we consider a result of Hoffman [J. Res. Nat. Bur. Stand., 49 (1952) pp. 263–265] about approximate solutions to systems of linear inequalities. We obtain a new representation for a corresponding Lipschitz bound via singular values. We also provide geometric representations of these bounds via extreme points. The latter have been developed independently by Bergthaller and Singer [Linear Algebra Appl., 169 (1992), pp. 111–129] and Li [Linear Algebra Appl., 187 (1993), pp. 15–40], but, our proofs are simpler. We obtain a particularly simple proof of Hoffman's existence result which relies only on linear programming duality.Keywords
This publication has 19 references indexed in Scilit:
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear programLinear Algebra and its Applications, 1993
- Augmented Lagrangian algorithms for linear programmingJournal of Optimization Theory and Applications, 1992
- The distance to a polyhedronLinear Algebra and its Applications, 1992
- On the convergence properties of Hildreth's quadratic programming algorithmMathematical Programming, 1990
- On approximate solutions of infinite systems of linear inequalitiesLinear Algebra and its Applications, 1989
- Global Regularity TheoremsMathematics of Operations Research, 1988
- Sensitivity theorems in integer linear programmingMathematical Programming, 1986
- The Relaxation Method for Solving Systems of Linear InequalitiesMathematics of Operations Research, 1980
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- On approximate solutions of systems of linear inequalitiesJournal of Research of the National Bureau of Standards, 1952