A finite method for solution of a general linear programming problem with a reduced number of iterations

A finite method is proposed for solution of a general linear programming problem. The algorithms are designed so that the search is performed only among vertices of the constrain polyhedron which are associated with vertices of a two-dimensional polyhedral set which is the mapping of the initial polyhedron on a plane chosen in a special / way. The mapping itself is not performed; a check is only made that the vertex is a vertex in the mapping.