Optimization Online


Unifying Condition Numbers for Linear Programming

Dennis Cheung (50003110***at***plink.cityu.edu.hk)
Felipe Cucker (macucker***at***math.cityu.edu.hk)
Javier Pena (jfp***at***andrew.cmu.edu)

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 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.

Keywords: condition numbers, data perturbations, distance to ill-posedness

Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )

Citation: Mathematics of Operations Research 28 (2003) 609--624.


Entry Submitted: 07/29/2002
Entry Accepted: 07/29/2002
Entry Last Modified: 11/01/2003

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society