Algorithm for solving linear programming problem based on simplex method

Often problems solved using computers require the most complete consideration of several goals. The need to develop an algorithm scheme for a linear programming problem is justified by the fact that in it, along with recording the actions performed, logical links are determined to achieve the set goals. The article discusses the stages of development of the algorithm for solving a management problem using the simplex method as well as the results of solving the problem using this algorithm. The instruction for a computer is the program based on the proposed algorithm for solving the problem. The advantage of the proposed algorithm for solving the linear programming problem is that it allows obtaining optimal solutions both at the planning stage and during operational management, and subsequently makes it possible to assess the effectiveness of organizations' activities from the standpoint of a system approach. The developed algorithm can be used when setting problems for their subsequent solution on a computer.