Nonadjacent extreme point methods for solving linear programs (Q3673477)
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: Nonadjacent extreme point methods for solving linear programs |
scientific article; zbMATH DE number 3827577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonadjacent extreme point methods for solving linear programs |
scientific article; zbMATH DE number 3827577 |
Statements
Nonadjacent extreme point methods for solving linear programs (English)
0 references
1983
0 references
nonadjacent extreme point methods
0 references
block pivoting
0 references
advanced basis
0 references
relaxation method
0 references
feasible directions method
0 references
optimal basis
0 references
reduced gradient method
0 references
dual linear programs
0 references
binding hyperplanes
0 references
two phase simplex method
0 references
randomly generated test problems
0 references
numerical comparison of algorithms
0 references
