No label defined (Q4035581)
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 176425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 176425 |
Statements
18 May 1993
0 references
linear constraints
0 references
piecewise linear network programming
0 references
algorithms
0 references
dual simplex algorithm
0 references
cut-sets
0 references
ratio test
0 references
0.8433290123939514
0 references
0.8331520557403564
0 references
0.8114238381385803
0 references
0.8096950650215149
0 references
[For the entire collection see Zbl 0753.00017.] A sub-area of mathematical programming named piecewise linear network programming is explored. The authors study some applications and propose specialized algorithms for them. A computational experiment performed with a dual simplex algorithm is discussed. It makes use of cut-sets for an efficient implementation of the ratio test.
0 references