Numerical behavior of LP algorithms based upon the decomposition principle

DOI10.1016/0024-3795(84)90186-1zbMATH Open0555.65040OpenAlexW2101940983MaRDI QIDQ760768FDOQ760768

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)

Cites Work

• Decomposition Principle for Linear Programs
• Error analysis of floating-point computation
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Interior-point algorithms for Dantzig and Wolfe decomposition principle
• Convergence behavior of decomposition algorithms for linear programs

Uses Software

• DEVEX

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A Decomposition Method and Its Application to Convex Programming 👍 👎
• Lagrangean decomposition for integer nonlinear programming with linear constraints 👍 👎
• Numerical experiments in a new class of algorithms in linear programming 👍 👎
• Convergence behavior of decomposition algorithms for linear programs 👍 👎
• The decomposition principle and algorithms for linear programming 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760768)