Numerical behavior of LP algorithms based upon the decomposition principle (Q760768): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(84)90186-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2101940983 / rank | |||
Normal rank | |||
Revision as of 18:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical behavior of LP algorithms based upon the decomposition principle |
scientific article |
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
