The parallel simplex-method achievements for errorless solving of linear programming problems

zbMATH Open1352.90062MaRDI QIDQ5741522FDOQ5741522

Authors: A. V. Panyukov, V. V. Gorbik 

Publication date: 25 July 2016

Full work available at URL: http://mathnet.ru/eng/vyuru179

Recommendations

• Using massively parallel computations for absolutely precise solution of the linear programming problems
• Exact solutions to linear programming problems
• Linear Programming in O([n3/ln n]L) Operations
• scientific article; zbMATH DE number 1303552
• A parallel algorithm for linear programming problems

zbMATH Keywords

optimizationlinear programmingdistributed computingparallel computinginterval arithmeticsimplex methodarbitrary precisionrational computations

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (2)

• Using massively parallel computations for absolutely precise solution of the linear programming problems
• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.

This page was built for publication: The parallel simplex-method achievements for errorless solving of linear programming problems

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