Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems (Q4721880)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3993327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems |
scientific article; zbMATH DE number 3993327 |
Statements
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems (English)
0 references
1986
0 references
computational complexity
0 references
average running time
0 references
simplex algorithm
0 references
pivoting algorithm
0 references
lexicographic Lemke algorithm
0 references
random linear complementarity
0 references
0 references
0 references
0.8194252848625183
0 references
0.8144922852516174
0 references
0.8094087839126587
0 references
0.8048210144042969
0 references
0.8040117025375366
0 references
