A strongly polynomial algorithm for linear systems having a binary solution (Q715067)

The paper describes a strongly polynomial algorithm which either finds a solution to a linear system with integer coefficients, or correctly decides that the system does not have 0,1-solutions. The algorithm can be used as a basis for the construction of a polynomial algorithm for linear programming, which differs substantially from the well-known polynomial algorithms. The most important properties on which the method is based are the (Hahn-Banach) separation theorem for disjoint convex sets and the Cauchy-Schwarz inequality.