On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data

DOI10.1287/MOOR.22.4.769MaRDI QIDQ4385160zbMATH OpenOpenAlexFDO

Authors Sharon Filipowski

Publication date 13 April 1998

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.22.4.769

zbMATH Keywords

approximate datasymmetric linear programs

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
• scientific article; zbMATH DE number 1099078
• On the complexity of solving feasible systems of linear inequalities specified with approximate data

Cited in

(8)

• Condition measures and properties of the central trajectory of a linear program
• On the complexity of solving feasible systems of linear inequalities specified with approximate data
• On the block-structured distance to non-surjectivity of sublinear mappings
• Extreme points of well-posed polytopes
• scientific article; zbMATH DE number 1099078 (Why is no real title available?)
• On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
• The radius of metric regularity
• Approximation Bounds for Sparse Programs

This page was built for publication: On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385160)