Distributed Fejer processes for systems of linear inequalities and problems of linear programming

Consideration was given to the proper (solvable) and improper (having no conventional solution) problems of linear programming of the first, second, and third kinds. They were reduced to compatible or incompatible systems of linear inequalities. To solve them numerically, different variants of the iterative Fejer methods (processes) converging, respectively, to solutions or quasisolutions of these systems were constructed. Efficient software realizations of these methods, in particular, decomposition and parallel calculations, were discussed.