A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method (Q6660154)
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 steepest feasible direction method for linear programming. Derivation and embedding in the simplex method |
scientific article; zbMATH DE number 7964569
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method |
scientific article; zbMATH DE number 7964569 |
Statements
A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method (English)
0 references
10 January 2025
0 references
linear programming
0 references
simplex method
0 references
steepest edge
0 references
feasible direction
0 references
external pivoting
0 references
0 references
0 references
