No label defined (Q4451485)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2047294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2047294 |
Statements
26 February 2004
0 references
optimization
0 references
simplex method
0 references
0.7975388765335083
0 references
0.7770664691925049
0 references
For a linear programming problem with \(n\) variables, with positive coefficients and under some additional restrictions, the authors propose an algorithm for selecting \(n\) linear algebraic equations whose solution yields the optimal solution. Several examples are elaborated in which the proposed algorithm is more efficient than the simplex method. For the entire collection see [Zbl 1011.00025].
0 references