Relaxation Method for Large Scale Linear Programming Using Decomposition

DOI10.1287/MOOR.16.4.859MaRDI QIDQ3989821zbMATH OpenOpenAlexFDO

Authors Paul Tseng

Publication date 28 June 1992

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.16.4.859

zbMATH Keywords

decompositiondual ascent methodnetwork flowside constraints

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• Relaxation methods for monotropic programs
• Relaxation Methods for Linear Programs
• scientific article; zbMATH DE number 4027166
• An efficient decomposition method for linear programming problems
• An augmented Lagrangian decomposition method for block diagonal linear programming problems

Cited in

(3)

• Relaxation Methods for Linear Programs
• Vector Space Decomposition for Solving Large-Scale Linear Programs
• Application of possibilistic optimization to interval-valued fuzzy numbers: supplemental diet

This page was built for publication: Relaxation Method for Large Scale Linear Programming Using Decomposition

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