A new steepest edge approximation for the simplex method for linear programming (Q1273430)
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 steepest edge approximation for the simplex method for linear programming |
scientific article; zbMATH DE number 1230447
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new steepest edge approximation for the simplex method for linear programming |
scientific article; zbMATH DE number 1230447 |
Statements
A new steepest edge approximation for the simplex method for linear programming (English)
0 references
1998
0 references
steepest edge approximation
0 references
simplex method
0 references
steepest edge pricing
0 references
0.95965314
0 references
0.90858275
0 references
0.9058916
0 references
0.8977785
0 references
0.89044464
0 references
0.8850273
0 references
