On the worst case complexity of potential reduction algorithms for linear programming (Q1373761): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:13, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the worst case complexity of potential reduction algorithms for linear programming |
scientific article |
Statements
On the worst case complexity of potential reduction algorithms for linear programming (English)
0 references
3 August 1998
0 references
lower bounds on complexity
0 references
interior point algorithms
0 references
potential reduction algorithms
0 references
