Updating lower bounds when using Karmarkar's projective algorithm for linear programming (Q1321368)
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: Updating lower bounds when using Karmarkar's projective algorithm for linear programming |
scientific article; zbMATH DE number 557854
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Updating lower bounds when using Karmarkar's projective algorithm for linear programming |
scientific article; zbMATH DE number 557854 |
Statements
Updating lower bounds when using Karmarkar's projective algorithm for linear programming (English)
0 references
27 April 1994
0 references
interior-point methods
0 references
lower bounds
0 references
Todd-Burrell update
0 references
Karmarkar's algorithm
0 references
0 references
0.8974478
0 references
0.88847244
0 references
0.8876617
0 references
0.8859012
0 references
0.88193333
0 references
0.8814322
0 references
0.8765486
0 references
