An all-integer cutting method for linear constrained optimization problems on arrangements

A method for solving linear constrained optimization problems on arrangements is proposed and validated. It is based on the idea of cutting methods. The use of cutting inequalities of a special form makes it possible to avoid the negative effect of computational errors, which is characteristic of the greater part of methods based on this approach. The form of correct integer cuts for the problems under consideration is established, and the algorithm based on such cuts is proved to be finite.