## Condition and Complexity Measures for Infeasibility Certificates of Systems of Linear Inequalities and Their Sensitivity Analysis (2002)

by
Hugo J. Lara
,
Levent Tunçel

Citations: | 1 - 1 self |

### BibTeX

@TECHREPORT{Lara02conditionand,

author = {Hugo J. Lara and Levent Tunçel},

title = {Condition and Complexity Measures for Infeasibility Certificates of Systems of Linear Inequalities and Their Sensitivity Analysis},

institution = {},

year = {2002}

}

### OpenURL

### Abstract

We begin with a study of the infeasibility measures for linear programming problems. For this purpose, we consider feasibility problems in Karmarkar's standard form. Our main focus is on the complexity measures which can be used to bound the amount of computational effort required to solve systems of linear inequalities and related problems in certain ways.