Interior-point methods with decomposition for solving large-scale linear programs
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.
scientific article; zbMATH DE number 1347776
scientific article