On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
From MaRDI portal
Publication:4702320
DOI10.1137/S1052623494268467zbMath0955.90086MaRDI QIDQ4702320
Publication date: 24 November 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
approximate solutions; knowledge; complexity of linear programming; approximate data; condition measures
90C60: Abstract computational complexity for mathematical programming problems
90C05: Linear programming
Related Items