INTERDEPENDENT VARIABLES IN LINEAR PROGRAMMING TASKS
The article analyses the possibility of using the simplex method to solvelinear programming problems with interdependent variable coefficients. The problemwith the interdependence of evaluation coefficients is that different columns can bedependent on each other, which can cause difficulties in determining the minimumestimate - on each iteration of the simplex method. This is especially relevantwhen determining the optimal (for each iteration) values of variable coefficients. Thework shows that the averaging of values proposed by a number of researchers isoptional, the exception is degenerate linear programming problems in which there isa nonsingularity of the solution