Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- 1 January 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 32 (1), 140-153
- https://doi.org/10.1137/s036301299222723x
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Minimum principle sufficiencyMathematical Programming, 1992
- The distance to a polyhedronLinear Algebra and its Applications, 1992
- Finite termination of the proximal point algorithmMathematical Programming, 1991
- On the convergence properties of Hildreth's quadratic programming algorithmMathematical Programming, 1990
- Global Regularity TheoremsMathematics of Operations Research, 1988
- Sensitivity theorems in integer linear programmingMathematical Programming, 1986
- Strong uniqueness and second order convergence in nonlinear discrete approximationNumerische Mathematik, 1980
- The Relaxation Method for Solving Systems of Linear InequalitiesMathematics of Operations Research, 1980
- Strong uniquenessNumerische Mathematik, 1978
- On approximate solutions of systems of linear inequalitiesJournal of Research of the National Bureau of Standards, 1952