Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules (Q5413871)
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 6291232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules |
scientific article; zbMATH DE number 6291232 |
Statements
Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules (English)
0 references
2 May 2014
0 references
monotonic build-up simplex algorithm
0 references
primal simplex method
0 references
index selection rules
0 references
linear programming
0 references
0 references
0 references
0.8194348216056824
0 references
0.7655906677246094
0 references
0.7650971412658691
0 references
0.7646698951721191
0 references
0.7619462013244629
0 references
