Parallel algorithm for solving linear programming problem under conditions of incomplete data
type: Item
instance of: scholarly article
title: Parallel algorithm for solving linear programming problem under conditions of incomplete data
zbMATH Open document ID: 1202.90193
DOI: 10.1134/S0005117910070210
author: I. M. Sokolinskaya
author: L. B. Sokolinsky
published in: Automation and Remote Control
publication date: 2011-01-03T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 5831145
describes a project that uses: MPI
describes a project that uses: OSL
MaRDI profile type: Publication
cites work: Q3992464
cites work: Q4827938
cites work: Implementing the simplex method for the Optimization Subroutine Library
cites work: An interior point method in Dantzig-Wolfe decomposition
cites work: Distributed Fejer processes for systems of linear inequalities and problems of linear programming
full work available at URL: s0005117910070210
OpenAlex ID: W2074155589
Recommended article: A parallel algorithm for linear programming problems
Recommended article: Q3217943
Recommended article: A parallel integer linear programming algorithm
Recommended article: Efficient parallel linear programming
Recommended article: Q3481514
Recommended article: Parallel pivotal algorithm for solving the linear complementarity problem
Recommended article: Parallel algorithms for nonlinear programming problems
Recommended article: An optimal parallel algorithm for linear programming in the plane
Recommended article: Parallel algorithms for large-scale linearly constrained minimization problem
Recommended article: A parallel alternating iterative algorithm for linear complementarity problems
description: scientific article; zbMATH DE number 5831145