Recent advances in the decomposition approach to linear programming

DOI10.1007/BFb0121182zbMath0636.90058OpenAlexW42730899MaRDI QIDQ3777795

James K. Ho

Publication date: 1987

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0121182

zbMATH Keywords

parallel computationlarge structured linear programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Decomposition methods (49M27)

Related Items (6)

Decomposition of linear programs using parallel computation ⋮ Composite-variable modeling for service parts logistics ⋮ Triangularity of the basis in linear programs for material requirements planning ⋮ A fuzzy satisficing method for large-scale linear programming problems with block angular structure ⋮ Converging upon basic feasible solutions through Dantzig-Wolfe decomposition ⋮ A novel modeling approach for express package carrier planning

This page was built for publication: Recent advances in the decomposition approach to linear programming