Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations

DOI10.1023/B:CASA.0000041990.90992.BDzbMath1078.90058OpenAlexW2027832705MaRDI QIDQ1780260

O. A. Emets, L. N. Kolechkina

Publication date: 7 June 2005

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:casa.0000041990.90992.bd

zbMATH Keywords

set of permutationspermutation polyhedroncombinatorial setfractional-linear functionmethod of combinatorial truncation

Mathematics Subject Classification ID

Fractional programming (90C32) Linear programming (90C05)

Related Items (5)

Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements ⋮ A modification of the method of combinatorial truncation in optimization problems over vertex-located sets ⋮ Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations ⋮ Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence ⋮ Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations

This page was built for publication: Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations