28 citations · 89 across the 13 of their papers we have counts for
13 papers
Surface Movement Method for Linear Programming
Nikolay A. Olkhovsky, Leonid B. Sokolinsky
The article presents a new method of linear programming, called the surface movement method. This method constructs an optimal objective path on the surface of the feasible polytop…
Visualizing Multidimensional Linear Programming Problems
Nikolay A. Olkhovsky, Leonid B. Sokolinsky
The article proposes an n-dimensional mathematical model of the visual representation of a linear programming problem. This model makes it possible to use artificial neural network…
VaLiPro: Linear Programming Validator for Cluster Computing Systems
Leonid B. Sokolinsky, Irina M. Sokolinskaya
The article presents and evaluates a scalable algorithm for validating solutions of linear programming problems on cluster computing systems. The main idea of the method is to gene…
FRaGenLP: A Generator of Random Linear Programming Problems for Cluster Computing Systems
Leonid B. Sokolinsky, Irina M. Sokolinskaya
The article presents and evaluates a scalable FRaGenLP algorithm for generating random linear programming problems of large dimension on cluster computing systems. To ensure th…
BSF-skeleton: A Template for Parallelization of Iterative Numerical Algorithms on Cluster Computing Systems
Leonid B. Sokolinsky
This article describes a method for creating applications for cluster computing systems using the parallel BSF skeleton based on the original BSF (Bulk Synchronous Farm) model of p…
BSF: a parallel computation model for scalability estimation of iterative numerical algorithms on cluster computing systems
Leonid B. Sokolinsky
This paper examines a new parallel computation model called bulk synchronous farm (BSF) that focuses on estimating the scalability of compute-intensive iterative algorithms aimed a…