Unifying Condition Numbers for Linear Programming

Authors:
Dennis Cheung;Felipe Cucker;Javier Peña
Affiliations:
-;-;-
Venue:
Mathematics of Operations Research
Year:
2003

Citing 0
Cited 7

Probabilistic analysis of condition numbers for linear programming

Journal of Optimization Theory and Applications
A note on level-2 condition numbers

Journal of Complexity
Solving linear programs with finite precision: II. algorithms

Journal of Complexity
Optimization and NP_R-completeness of certain fewnomials

Proceedings of the 2009 conference on Symbolic numeric computation
A note on level-2 condition numbers

Journal of Complexity
Solving linear programs with finite precision: II. Algorithms

Journal of Complexity
On strata of degenerate polyhedral cones, II: Relations between condition measures

Journal of Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, several condition numbers were defined for a variety of linear programming problems based upon relative distances to ill-posedness. In this paper, we provide a unifying view of some of these condition numbers. To do so, we introduce yet another linear programming problem and show that its distance to ill-posedness naturally captures the most commonly used distances to ill-posedness.