The distance to a polyhedron

DOI10.1016/0024-3795(92)90174-9zbMath0759.15008MaRDI QIDQ1187387

S. Singh

Publication date: 23 July 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(92)90174-9

zbMATH Keywords

estimates; polyhedron; distance; normed linear space

Mathematics Subject Classification ID

90C05: Linear programming

15A39: Linear inequalities of matrices

15A60: Norms of matrices, numerical range, applications of functional analysis to matrix theory

Related Items

Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation **, Error bounds for solutions of linear equations and inequalities, The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program, Error bounds for analytic systems and their applications, Error bounds in mathematical programming, Error estimates and Lipschitz constants for best approximation in continuous function spaces, A note of Lipschitz constants for solutions of linear inequalities and equations, Duality for optimization and best approximation over finite intersections

Cites Work

• Bounds for error in the solution set of a perturbed linear program
• Sensitivity theorems in integer linear programming
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• Quelques classes de problèmes extrémaux
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item