On the complexity of linear programming under finite precision arithmetic (Q1380938)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of linear programming under finite precision arithmetic |
scientific article; zbMATH DE number 1127726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of linear programming under finite precision arithmetic |
scientific article; zbMATH DE number 1127726 |
Statements
On the complexity of linear programming under finite precision arithmetic (English)
0 references
11 March 1998
0 references
interior point methods
0 references
error analysis
0 references
conditioning
0 references
finite precision arithmetic
0 references
computing error bounds
0 references
logarithmic barrier method
0 references
0 references
0.8541148900985718
0 references
0.8056317567825317
0 references
0.7977811694145203
0 references
