Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927)
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: Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems |
scientific article; zbMATH DE number 5227923
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems |
scientific article; zbMATH DE number 5227923 |
Statements
Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (English)
0 references
18 January 2008
0 references
feasibility problem
0 references
Anstreicher-Terlaky type monotonic simplex algorithms
0 references
degeneracy
0 references
linear programming
0 references
0 references
0 references
