RPD-algorithm for optimization of developing systems in large-scale linear programming problems

DOI10.1007/BF01068612MaRDI QIDQ4007473zbMATH OpenFDO

Authors Michail D. Godlevsky

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

large-scale linear programming

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

• scientific article; zbMATH DE number 5018767
• A modified super convergent line series algorithm for solving linear programming problems
• scientific article; zbMATH DE number 4176823
• scientific article; zbMATH DE number 2047294
• scientific article; zbMATH DE number 4172286

Cited in

(1)

• A space decomposition-based deterministic algorithm for solving linear optimization problems

This page was built for publication: RPD-algorithm for optimization of developing systems in large-scale linear programming problems

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