An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522)
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: An efficient simplex type algorithm for sparse and dense linear programs. |
scientific article; zbMATH DE number 1924667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient simplex type algorithm for sparse and dense linear programs. |
scientific article; zbMATH DE number 1924667 |
Statements
An efficient simplex type algorithm for sparse and dense linear programs. (English)
0 references
9 June 2003
0 references
Linear programming
0 references
Simplex type algorithms
0 references
Big-\(M\) method
0 references
Algorithm
0 references
evaluation
0 references
Numerical experiments
0 references
0 references
0 references
0.7984631657600403
0 references
0.7809128165245056
0 references
