The structure of an integral monoid and integer programming feasibility (Q2277141): Difference between revisions

An integer programming problem is feasible if the right-hand side vector belongs to the integral monoid generated by columns of the left-hand side matrix. The author investigates a group structure on the elements of the monoid situated in the boxes restricted by at most \(k\) (\(k\) is a constant depending on the matrix) summand columns of the matrix and suggests a method for testing feasibility. The method is more efficient for problems with fixed matrix and varying right-hand side.