Parallel algorithm for solving linear programming problem under conditions of incomplete data

Authors:
I. M. Sokolinskaya;L. B. Sokolinskii
Affiliations:
South Ural State University, Chelyabinsk, Russia;South Ural State University, Chelyabinsk, Russia
Venue:
Automation and Remote Control
Year:
2010

Citing 7
Cited 0

Critical issues in mapping neural networks on message-passing multicomputers

ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
Hypercube implementation of the simplex algorithm

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Implementing the simplex method for the Optimization Subroutine Library

IBM Systems Journal
A message passing standard for MPP and workstations

Communications of the ACM
An interior point method in Dantzig-Wolfe decomposition

Computers and Operations Research
A Survey of Resource Directive Decomposition in Mathematical Programming

ACM Computing Surveys (CSUR)
Distributed Fejer Processes for Systems of Linear Inequalities and Problems of Linear Programming

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

Approach to solve linear programming problem under nonformalized constraints is proposed. The approach is designed for multiprocessor computing systems with massive parallel processing.