On the complexity of solving feasible systems of linear inequalities specified with approximate data
From MaRDI portal
Publication:1919805
DOI10.1007/BF01590957zbMath0851.90083MaRDI QIDQ1919805
Publication date: 28 July 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (3)
Linear programming, complexity theory and elementary functional analysis ⋮ A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem ⋮ Condition measures and properties of the central trajectory of a linear program
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Systems of linear interval equations
- On condition numbers and the distance to the nearest ill-posed problem
- Some perturbation theory for linear programming
- Bounds for error in the solution set of a perturbed linear program
- On the solution of linear algebraic equations with interval coefficients
- Some Remarks on the Foundations of Numerical Analysis
- A Condition Number for Differentiable Convex Inequalities
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Perturbation Analysis of a Condition Number for Linear Systems
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
- Paths, Trees, and Flowers
- On Perturbations in Systems of Linear Inequalities
- Numerical inverting of matrices of high order
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
This page was built for publication: On the complexity of solving feasible systems of linear inequalities specified with approximate data
