Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765)
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: Strict monotonicity in Todd's low-complexity algorithm for linear programming |
scientific article; zbMATH DE number 95773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strict monotonicity in Todd's low-complexity algorithm for linear programming |
scientific article; zbMATH DE number 95773 |
Statements
Strict monotonicity in Todd's low-complexity algorithm for linear programming (English)
0 references
16 January 1993
0 references
interior point algorithm
0 references
potential function
0 references
strictly monotone algorithm
0 references
0.89988816
0 references
0.8862783
0 references
0.8784329
0 references
0.8769067
0 references
0.87144995
0 references
0 references
0.86779374
0 references
0.86776406
0 references
0.86740625
0 references
