The algorithm for generating output document when solving a simplex transport problem
Автор: Bozhko L.M., Dergachev A.I., Dergachev S.A.
Рубрика: Математическое моделирование
Статья в выпуске: 4, 2025 года.
Бесплатный доступ
Since resource efficiency is a pressing issue, the question arises as to how best to use limited resources. The purpose of the study is to develop an algorithm for solving a linear programming problem that contributes to the adoption of the optimal solution. In the article, a linear programming problem was chosen as a sample of project documentation (preparation for a computer solution), and a simplex method was used. Solving this problem enables to find the best option for using the allocated resources. Stages of development of an algorithm of linear programming problem on output of solution result in accordance with specified output document layout are described. The proposed procedure for formalizing the result of solving the problem allows to reduce the time for making a management decision.
Linear programming, linear programming problem, simplex method, transport problem, document generation algorithm
Короткий адрес: https://sciup.org/148332825
IDR: 148332825 | УДК: 004.021 | DOI: 10.18137/RNU.V9187.25.04.P.11