Abstract
A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations. The performance of sub algorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed by conducting numerical experiments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods to Solve Combinatory Optimization Problems on Computers [in Russian], Naukova Dumka, Kyiv (1981).
V. I. Baranov and B. S. Stechkin, Extreme Combinatory Problems and their Application [in Russian], Nauka, Moscow (1989).
Yu. G. Stoyan and O. O. Yemets, Theory and Methods of Euclidean Combinatory Optimization [in Ukrainian], ISDO, Kyiv (1993).
Yu. G. Stoyan, O. O. Yemets and E. M. Yemets, Optimization on Polypermutations: Theory and Methods: A Monograph [in Ukrainian], RVTs PUSKU, Poltava (2005).
O. O. Yemets and L. M. Kolechkina, Combinatory Optimization Problems with Linear Fractional Objective Functions: A Monograph [in Ukrainian], Naukova Dumka, Kyiv (2005).
O. O. Yemets and O. V. Roskladka, Optimization Problems on Polycombinatorial Sets: Properties and Solution: A Monograph [in Ukrainian], RVTs PUSKU, Poltava (2006).
D. B. Yudin and E. G. Gol’dshtein, Linear Programming [in Russian], Fizmatgiz, Moscow (1963).
A. A. Korbut and Yu. Yu. Finkel’shtein, Discrete Programming [in Russian], Nauka, Moscow (1969).
O. O. Yemets and L. M. Kolechkina, “Solving optimization problems with linear-fractional objective function over permutations,” Visa Derzh. Univ. “L’vivs’ka Politekhnika,” Ser. Prykl. Matem., 2, No. 337, 317–320 (1998).
O. O. Yemets and L. M. Kolechkina, “Optimization problem over permutations with linear-fractional objective function: Properties of the set of feasible solutions,” Ukr. Mat. Zh., 52, No. 12, 1630–1640 (2000).
O. A. Emets and E. V. Roskladka, “Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method,” Cybern. Syst. Analysis, 38, No. 1, 117–123 (2002).
O. A. Emets and T. N. Barbolina, “Solving linear optimization problems on arrangements by the truncation method,” Cybern. Syst. Analysis, 39, No. 6, 889–896 (2003).
O. A. Yemets and T. N. Barbolina, “Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence,” Cybern. Syst. Analysis, 40, No. 5, 726–734 (2004).
O. A. Yemets and O. O. Chernenko, “Solving an unconditional problem with a linear-fractional objective function on a general set of permutations,” Radioelectr. Informatika, No. 4, 144–149 (2005).
O. A. Yemets and O. A. Chernenko, “A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements,” Cybern. Syst. Analysis, 41, No. 2, 246–254 (2005).
O. O. Yemets and O. O. Chernenko, “A lexicographic method to solve a linear-fractional conditional problem on permutations,” in: Proc. 2nd Seminal School on Decision-Making Theory, September 27–October 2, 2004, Uzhgorod [in Ukrainian], Uzhgorod (2004).
Author information
Authors and Affiliations
Additional information
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 133–146, July–August 2007.
Rights and permissions
About this article
Cite this article
Yemets, O.A., Chernenko, O.A. Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations. Cybern Syst Anal 43, 576–585 (2007). https://doi.org/10.1007/s10559-007-0083-1
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-007-0083-1