A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements (Q2577240)

It was proved in an earlier paper [\textit{O. O. Emets, O. V. Roskladka} and \textit{S. I. Nedobachii}, Ukr. Math. J. 55, No. 1, 1--12 (2003; Zbl 1039.90058)] that, for general problems of combinatorial optimization on arrangements, the system of inequalities describing the polyhedron of arrangements, the convex envelope of the set of arrangements, is generated by a minimal, irreducible subsystem which does not contain inequalities that can be omitted. The paper under review is devoted to a specific case of a linear optimization problem, to which a fractional-linear optimization problem on arrangements is reduced. For this situation, a system of irreducible constraints is found explicitly.