Numerical behavior of LP algorithms based upon the decomposition principle

DOI10.1016/0024-3795(84)90186-1zbMath0555.65040OpenAlexW2101940983MaRDI QIDQ760768

Larry Nazareth

Publication date: 1984

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(84)90186-1

zbMATH Keywords

Dantzig-Wolfe decompositionfeasible and optimal solutionsfull master programnumerical behavior

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items (1)

Convergence behavior of decomposition algorithms for linear programs

Uses Software

• DEVEX

Cites Work

• Error analysis of floating-point computation
• Decomposition Principle for Linear Programs
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Numerical behavior of LP algorithms based upon the decomposition principle