# A new condition number for linear programming

@article{Cheung2001ANC, title={A new condition number for linear programming}, author={D. Cheung and F. Cucker}, journal={Mathematical Programming}, year={2001}, volume={91}, pages={163-174} }

Abstract.In this paper we define a new condition number ?(A) for the following problem: given a m by n matrix A, find x∈ℝn, s.t. Ax<0. We characterize this condition number in terms of distance to ill-posedness and we compare it with existing condition numbers for the same problem.

#### Topics from this paper

#### 62 Citations

Unifying Condition Numbers for Linear Programming

- Mathematics, Computer Science
- Math. Oper. Res.
- 2003

24- PDF

Solving linear programs with finite precision: I. Condition numbers and random programs

- Mathematics, Computer Science
- Math. Program.
- 2004

21

Stability under perturbations of some condition numbers in optimization

- Mathematics, Computer Science
- Math. Program.
- 2009

2

On the Expected Condition Number of Linear Programming Problems

- Mathematics, Computer Science
- Numerische Mathematik
- 2003

30- PDF

Some preconditioners for systems of linear inequalities

- Mathematics, Computer Science
- Optim. Lett.
- 2014

3 Highly Influenced- PDF

#### References

SHOWING 1-7 OF 7 REFERENCES

Condition numbers for polyhedra with real number data

- Mathematics, Computer Science
- Oper. Res. Lett.
- 1995

45- PDF

Linear programming, complexity theory and elementary functional analysis

- Mathematics, Computer Science
- Math. Program.
- 1995

245- PDF

Pre-Conditioners and Relations between Different Measures of Conditioning for Conic Linear Systems

- Mathematics
- 2000

3 Highly Influential

Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system

- Mathematics, Computer Science
- Math. Program.
- 1999

119- PDF

Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming

- Mathematics, Computer Science
- Math. Oper. Res.
- 1994

45

A primal-dual interior point method whose running time depends only on the constraint matrix

- Mathematics, Computer Science
- Math. Program.
- 1996

135

Incorporating Condition Measures into the Complexity Theory of Linear Programming

- Mathematics, Computer Science
- SIAM J. Optim.
- 1995

179- PDF