arXiv Analytics

Sign in

arXiv:2006.14921 [math.OC]AbstractReferencesReviewsResources

Scalable Method for Linear Optimization of Industrial Processes

Leonid B. Sokolinsky, Irina M. Sokolinskaya

Published 2020-06-26Version 1

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.

Related articles: Most relevant | Search more
arXiv:1312.4489 [math.OC] (Published 2013-12-16, updated 2014-10-30)
An Improvised Approach to Robustness in Linear Optimization
arXiv:2409.08119 [math.OC] (Published 2024-09-12)
Duality theory in linear optimization and its extensions -- formally verified
arXiv:1410.8226 [math.OC] (Published 2014-10-30)
Primal-Dual Entropy Based Interior-Point Algorithms for Linear Optimization