Using massively parallel computations for absolutely precise solution of the linear programming problems

DOI10.1134/S0005117912020063zbMath1307.90100OpenAlexW1974747661MaRDI QIDQ2261711

A. V. Panyukov, V. V. Gorbik

Publication date: 13 March 2015

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117912020063

Mathematics Subject Classification ID

Linear programming (90C05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

Improving of the identification algorithm for a quasilinear recurrence equation ⋮ Stable Identification of Linear Autoregressive Model with Exogenous Variables on the Basis of the Generalized Least Absolute Deviation Method

Uses Software

• CPLEX
• QSopt_ex

Cites Work

• Towards a practical parallelisation of the simplex method
• MINOS(IIS): Infeasibility analysis using MINOS
• On the efficacy of distributed simplex algorithms for linear programming
• Exact solutions to linear programming problems
• Parallel implementation of Newton’s method for solving large-scale linear programs
• Parallelizing the Dual Simplex Method

This page was built for publication: Using massively parallel computations for absolutely precise solution of the linear programming problems