|
This article is cited in 1 scientific paper (total in 1 paper)
Computational Mathematics
Implementation of parallel pursuit algorithm for solving unstable linear programming problems
I. M. Sokolinskaya, L. B. Sokolinsky South Ural State University, Chelyabinsk, Russian Federation
Abstract:
The paper describes an implementation of the parallel pursuit algorithm for solving unstable linear programming problems of high dimension on cluster computing systems. This algorithm uses Fejer's mappings for building pseudo-projection on polyhedron. The algorithm tracks changes in input data and corrects the calculation process. This task is divided into set of independent subtasks, which can be processed in parallel. The UML activity diagrams describing the algorithm implementation are presented.
Keywords:
unstable linear programming problem, Fejer's mappings, pursuit algorithm, UML activity diagrams, massive parallelism, cluster computing system.
Received: 06.03.2016
Citation:
I. M. Sokolinskaya, L. B. Sokolinsky, “Implementation of parallel pursuit algorithm for solving unstable linear programming problems”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 5:2 (2016), 15–29
Linking options:
https://www.mathnet.ru/eng/vyurv134 https://www.mathnet.ru/eng/vyurv/v5/i2/p15
|
Statistics & downloads: |
Abstract page: | 193 | Full-text PDF : | 52 | References: | 33 |
|