On the complexity of linear programming under finite precision arithmetic

Publisher Website

1 January 1998

journal article
Published by Springer Nature in Mathematical Programming

Vol. 80 (1) , 91-123
https://doi.org/10.1007/bf01582132

Abstract

No abstract available

Keywords

This publication has 7 references indexed in Scilit:

Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
SIAM Journal on Optimization, 1996
Incorporating Condition Measures into the Complexity Theory of Linear Programming
SIAM Journal on Optimization, 1995
Some perturbation theory for linear programming
Mathematical Programming, 1994
Interior-point methods for convex programming
Applied Mathematics & Optimization, 1992
On the classical logarithmic barrier function method for a class of smooth convex programming problems
Journal of Optimization Theory and Applications, 1992
Some Remarks on the Foundations of Numerical Analysis
SIAM Review, 1990
A polynomial-time algorithm, based on Newton's method, for linear programming
Mathematical Programming, 1988