Data mapping of linear programming on fixed-size hypercubes

DOI10.1016/0167-8191(90)90150-8MaRDI QIDQ751769zbMATH OpenOpenAlexFDO

Authors Gen-Huey Chen, Hong-Fa Ho, Shieu-Hong Lin, Jang-Ping Sheu

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90150-8

zbMATH Keywords

communication complexityhypercube computerlinear programmingLoad balancingsimplex method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Linear programming (90C05)

Review text

The authors consider the solution of the linear programming problem via the simplex method on a hypercube computer from a theoretical perspective. Load balancing questions and communication complexity are considered. There are no numerical experiments.

Recommendations

• Hypersphere mapper: A nonlinear programming approach to the hybercube embedding problem
• Structured mapping problems for linearly structured matrices
• On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
• scientific article; zbMATH DE number 1182931
• The problem of linear programming with approximate data
• Vector Space Decomposition for Solving Large-Scale Linear Programs
• PARALLEL ITERATIVE SOLUTION OF LARGE LINEAR SYSTEMS ON HYPERCUBES

This page was built for publication: Data mapping of linear programming on fixed-size hypercubes

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