Numerical behavior of LP algorithms based upon the decomposition principle
From MaRDI portal
Publication:760768
DOI10.1016/0024-3795(84)90186-1zbMATH Open0555.65040OpenAlexW2101940983MaRDI QIDQ760768FDOQ760768
Authors: 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
Recommendations
- Convergence behavior of decomposition algorithms for linear programs
- The decomposition principle and algorithms for linear programming
- Publication:4861609
- Numerical experiments in a new class of algorithms in linear programming
- An efficient decomposition method for linear programming problems
- scientific article
- scientific article; zbMATH DE number 3959143
- A Decomposition Method and Its Application to Convex Programming
- scientific article; zbMATH DE number 3912112
- Lagrangean decomposition for integer nonlinear programming with linear constraints
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)
Cites Work
- Title not available (Why is that?)
- Decomposition Principle for Linear Programs
- Title not available (Why is that?)
- Error analysis of floating-point computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Cited In (3)
Uses Software
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)
