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

DOI10.1137/S1052623494268467zbMath0955.90086OpenAlexW1977644479MaRDI QIDQ4702320

Sharon Filipowski

Publication date: 24 November 1999

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623494268467

zbMATH Keywords

approximate solutionsknowledgecomplexity of linear programmingapproximate datacondition measures

Mathematics Subject Classification ID

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

Related Items (2)

Extreme points of well-posed polytopes ⋮ Probabilistic analysis of the Grassmann condition number

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