A new analysis for monotonic type simplex algorithms for feasibility problems (Q3499368)
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 5281546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new analysis for monotonic type simplex algorithms for feasibility problems |
scientific article; zbMATH DE number 5281546 |
Statements
29 May 2008
0 references
feasibility problem
0 references
monoton simplex algorithms
0 references
degeneracy
0 references
linear programming
0 references
index selection rules
0 references
0.940617859363556
0 references
0.8104326725006104
0 references
0.7568364143371582
0 references
0.7509557008743286
0 references
0.7499185800552368
0 references
