A new linear programming algorithm - better or worse than the simplex method? (Q1153837)
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 new linear programming algorithm - better or worse than the simplex method? |
scientific article; zbMATH DE number 3726088
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new linear programming algorithm - better or worse than the simplex method? |
scientific article; zbMATH DE number 3726088 |
Statements
A new linear programming algorithm - better or worse than the simplex method? (English)
0 references
1980
0 references
simplex method
0 references
optimality condition
0 references
polynomial algorithm
0 references
well- characterized problem
0 references
duality
0 references
supervisor principle
0 references
ellipsoid algorithm
0 references
