APPLICATIONS OF EQUATIONS AND INEQUALITIES TO INTEGER LINEAR PROGRAMMING PROBLEMS.

In this work, an algorithm for solving a linear programming problem using the integer programming method is considered. This algorithm is also a very convenient algorithm. The linear programming problem was solved using the simple simplex method and the results were obtained. Since the results obtained were fractional, an additional equation called the “intersecting equation” was introduced and optimal solutions were obtained. The integer programming problem is often used to obtain the results of optimal planning of the work of an enterprise producing an indivisible product and other similar problems.

Перевод пока недоступен