On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data

Publisher Website

1 January 1999

journal article
Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization

Vol. 9 (4) , 1010-1040
https://doi.org/10.1137/s1052623494268467

Abstract

No abstract available

Keywords

This publication has 6 references indexed in Scilit:

Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system
Mathematical Programming, 1999
On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
Mathematics of Operations Research, 1997
Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
SIAM Journal on Optimization, 1996
Incorporating Condition Measures into the Complexity Theory of Linear Programming
SIAM Journal on Optimization, 1995
Some perturbation theory for linear programming
Mathematical Programming, 1994
Some Remarks on the Foundations of Numerical Analysis
SIAM Review, 1990