The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program

This publication has 10 references indexed in Scilit:

• The distance to a polyhedron
  Linear Algebra and its Applications, 1992
• On the convergence of the coordinate descent method for convex differentiable minimization
  Journal of Optimization Theory and Applications, 1992
• On the convergence properties of Hildreth's quadratic programming algorithm
  Mathematical Programming, 1990
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
  SIAM Journal on Control and Optimization, 1987
• Sensitivity theorems in integer linear programming
  Mathematical Programming, 1986
• The Relaxation Method for Solving Systems of Linear Inequalities
  Mathematics of Operations Research, 1980
• The Theory of Best Approximation and Functional Analysis
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1974
• Bounds for error in the solution set of a perturbed linear program
  Linear Algebra and its Applications, 1973
• On approximate solutions of systems of linear inequalities
  Journal of Research of the National Bureau of Standards, 1952
• Two Consequences of the Transposition Theorem on Linear Inequalities
  Econometrica, 1951