On the complexity of linear programming under finite precision arithmetic (Q1380938): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01582132 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039868808 / rank | |||
Normal rank | |||
Latest revision as of 11:10, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of linear programming under finite precision arithmetic |
scientific article |
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
