UDC 519.1
1 V.M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine
 georgdone@gmail.com
|
2 V.M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine
bilvassa@ukr.net
|
ON THE PROBLEM OF OPTIMAL SEARCH FOR LOCALLY FEASIBLE
SOLUTIONS OF A LINEAR FUNCTION ON PERMUTATIONS
Abstract. We consider the problem of optimal search for locally feasible solutions of a linear function on those permutations where the linear function takes the values from the given interval. We describe a new method of solving such problem by goal seeking for the permutations that provide locally feasible solutions with minimal search.
Keywords: linear function, permutation, transposition, balance, position, operation.
FULL TEXT
REFERENCES
- Donets G.P., Kolechkina L.M. Extreme problems on combinatorial configurations. Poltava: RVV PUET, 2011. 309 p.
- Donets G.A., Biletskyi V.I. On the localization problem for a linear function on permutations. Kibernetyka ta komp’yuterni tekhnologiï. 2020. N 2. P. 14–18.
- Donets G.A., Kolechkina L.N. On one optimization problem for a linear-fractional target function on permutations. Mezhdunarodnyy nauchno-tekhnicheskiy zhurnal «Problemy upravleniya i informatsii». 2010. N 2. P. 31–41.
- Semenova N.V., Kolechkina L.N., Nagorna A.N. An approach to solving vector discrete optimization problems on a combinatorial set of permutations. Kibernetika i sistemnyj analiz. 2008. N 3. P. 158–172.
- Emets O.O., Kolechkina L.M. Combinatorial optimization problems with fractional-linear objective functions. (Edited by I.V. Sergienko) [in Ukrainian]. Kyiv: Nauk. dumka, 2005. 117 p.
- Emets O.A., Barbolina T.N. Combinatorial optimization on placements. (Edited by I.V. Sergienko) [in Russian]. Kiev: Nauk. dumka, 2008. 159 p.
- Emets O.A., Chernenko O.A. Optimization of linear-fractional functions on placements. (Edited by I.V. Sergienko) [in Russian]. Kiev: Nauk. dumka, 2011. 139 p.
- Sergienko I.V., Emets O.A., Chernenko O.A. Solution of a conditional optimization problem for a linear fractional objective function on a set of placements by the branch and bound method. Kibernetika i sistemnyj analiz. 2012. N 6. P. 30–35.
