An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations

We study a set of linear constraints determining the domain of admissible solutions of a problem with linear objective function to which the optimisation problem with linear–fractional objective function on permutations is reduced.