A Family of Simplex Variants Solving an <i>m</i> × <i>d</i> Linear Program in Expected Number of Pivot Steps Depending on <i>d</i> Only (Q3755232)
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: A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only |
scientific article; zbMATH DE number 4003909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Family of Simplex Variants Solving an <i>m</i> × <i>d</i> Linear Program in Expected Number of Pivot Steps Depending on <i>d</i> Only |
scientific article; zbMATH DE number 4003909 |
Statements
A Family of Simplex Variants Solving an <i>m</i> × <i>d</i> Linear Program in Expected Number of Pivot Steps Depending on <i>d</i> Only (English)
0 references
1986
0 references
Simplex method
0 references
Constraint-By-Constraint procedure
0 references
pivoting rule
0 references
probabilistic models
0 references
0.9581002
0 references
0.9064418
0 references
0.89450413
0 references
0.8620735
0 references
0.85778826
0 references
0.85460454
0 references
