Numerical behavior of LP algorithms based upon the decomposition principle (Q760768)
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: Numerical behavior of LP algorithms based upon the decomposition principle |
scientific article; zbMATH DE number 3885228
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical behavior of LP algorithms based upon the decomposition principle |
scientific article; zbMATH DE number 3885228 |
Statements
Numerical behavior of LP algorithms based upon the decomposition principle (English)
0 references
1984
0 references
Although the full master program, obtained by applying the Dantzig-Wolfe decomposition principle to a given linear program has the same feasible and optimal solutions, the two programs are not numerically equivalent. In this paper the author presents some LP problems, involving only a few constraints and variables, each of which exhibits a particular numerical feature of the Dantzig-Wolfe decomposition algorithm, thus identifying numerical difficulties that can occur in general.
0 references
numerical behavior
0 references
full master program
0 references
Dantzig-Wolfe decomposition
0 references
feasible and optimal solutions
0 references
0 references
0.91053784
0 references
0.89395434
0 references
0.87508374
0 references
0.8706603
0 references
