Abstract:
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.
Received: 03.07.1998 Revised: 14.03.2000
Bibliographic databases:
UDC:519.85
Language: Russian
Citation:
O. A. Emets, S. I. Nedobachii, L. N. Kolechkina, “An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations”, Diskr. Mat., 13:1 (2001), 110–118; Discrete Math. Appl., 11:1 (2001), 95–103
\Bibitem{IemNedKol01}
\by O.~A.~Emets, S.~I.~Nedobachii, L.~N.~Kolechkina
\paper An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations
\jour Diskr. Mat.
\yr 2001
\vol 13
\issue 1
\pages 110--118
\mathnet{http://mi.mathnet.ru/dm271}
\crossref{https://doi.org/10.4213/dm271}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1846042}
\zmath{https://zbmath.org/?q=an:1134.90548}
\transl
\jour Discrete Math. Appl.
\yr 2001
\vol 11
\issue 1
\pages 95--103
Linking options:
https://www.mathnet.ru/eng/dm271
https://doi.org/10.4213/dm271
https://www.mathnet.ru/eng/dm/v13/i1/p110
This publication is cited in the following 4 articles:
O. A. Emets, T. N. Barbolina, “Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements”, Discrete Math. Appl., 17:1 (2007), 77–86
I. M. Stancu-Minasian, “A sixth bibliography of fractional programming”, Optimization, 55:4 (2006), 405
T. N. Barbolina, O. A. Emets, “An all-integer cutting method for linear constrained optimization problems on arrangements”, Comput. Math. Math. Phys., 45:2 (2005), 243–250
O. A. Yemets, T. N. Barbolina, “Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence”, Cybern Syst Anal, 40:5 (2004), 726
Citation in format AMSBIB
Contact us: