A new linear programming algorithm - better or worse than the simplex method? (Q1153837): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:27, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new linear programming algorithm - better or worse than the simplex method? |
scientific article |
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
