A Nonreducible System of Constraints of a Combinatorial Polyhedron in a Linear-Fractional Optimization Problem on Arrangements

A system of linear constraints is investigated. The system describes the domain of feasible solutions of a linear optimization problem to which a linear-fractional optimization problem on arrangements is reduced. A system of nonreducible constraints of a polyhedrom is established for the linear-fractional optimization problem on arrangements.__________Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 107–116, March–April 2005.