Papers › Scalable Method for Linear Optimization of Industrial Processes
Scalable Method for Linear Optimization of Industrial Processes
Leonid B. Sokolinsky, Irina M. Sokolinskaya
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In the development of industrial digital twins, the optimization problem of technological and business processes often arises. In many cases, this problem can be reduced to a large-scale linear programming (LP) problem. The article is devoted to the new method for solving large-scale LP problems. This method is called the "apex-method". The apex-method uses the predictor-corrector framework. The predictor step calculates a point belonging to the feasible region of LP problem. The corrector step calculates a sequence of points converging to the exact solution of the LP problem. The article gives a formal description of the apex-method and provides information about its parallel implementation in C++ language by using the MPI library. The results of large-scale computational experiments on a cluster computing system to study the scalability of the apex method are presented.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections