Interior-point methods with decomposition for solving large-scale linear programs (Q1306665)
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: Interior-point methods with decomposition for solving large-scale linear programs |
scientific article; zbMATH DE number 1347776
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Interior-point methods with decomposition for solving large-scale linear programs |
scientific article; zbMATH DE number 1347776 |
Statements
Interior-point methods with decomposition for solving large-scale linear programs (English)
0 references
16 December 2001
0 references
The author investigates an implementable algorithm suitable for solving large-scale programs which combines the interior-point method with the Dantzig-Wolfe decomposition one. It is proved that the algorithm under consideration has polynomial-time complexity and is globally linearly convergent.
0 references
large-scale linear programming
0 references
interior-point methods
0 references
Dantzig-Wolfe decomposition
0 references
algorithmic complexity
0 references
0 references
0 references
0 references
