Abstract
We consider an optimization problem on permutations with a linear-fractional objective function. We investigate the properties of the domain of admissible solutions of the problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedrons, Graphs, Optimization[in Russian], Nauka, Moscow (1981).
I. V. Sergienko, Mathematical Models and Methods for the Solution of Problems of Discrete Optimization[in Russian], Naukova Dumka, Kiev (1985).
I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods for the Computer Solution of Combinatorial Optimization Problems[in Russian], Naukova Dumka, Kiev (1981).
N. Z. Shor and D. I. Solomon, Decomposition Methods in Linear-Fractional Programming[in Russian], Shtiintsa, Kishinev (1989).
Yu. G. Stoyan and O. A. Emets, Theory and Methods of Euclidean Combinatorial Optimization[in Ukrainian], Institute of System Investigations in Education, Kiev (1993).
Yu. G. Stoyan, O. A. Emets, and E. M. Emets, “Sets of polydistributions in combinatorial optimization,” Dopov. Nats. Akad. Nauk Ukr., No. 8, 37–41 (1999).
Yu. G. Stoyan, S. V. Yakovlev, and O. A. Valuiskaya, “On the existence of convex extension of functions defined on a hypersphere,” Dopov. Nats. Akad. Nauk Ukr., No. 2, 128–133 (1998).
Yu. G. Stoyan, S. V. Yakovlev, O. A. Emets, and O. A. Valuiskaya, “Construction of convex extensions of functions defined on a hypersphere,” Kibern. Sistemn. Analiz, No. 2, 27–37 (1998).
Yu. G. Stoyan and O. A. Emets, “On combinatorial problems of arrangement of rectangles,” Ékonom. Mat. Met., 21, Issue 5, 868–881 (1985).
O. A. Pavlov and L. O. Pavlova, “Principle of parallelizing of calculations as a method for the improvement of the efficiency of PDS algorithms for complicated combinatorial problems,” Nauk. Visti NTUU “KPI”, No. 1, 22–26 (1997).
O. A. Emets, E. M. Emets, and L. N. Kolechkina, “Application of the truncation method for cutting,” Radioélektr. Informat., No. 3, 114–117 (1998).
O. A. Emets, “On one truncation method for problems of combinatorial optimization,” Ékonom. Mat. Met., 33, Issue4, 120–129 (1997).
O. A. Emets, “On the optimization of linear and convex functions on a Euclidean combinatorial set of permutations,” Zh. Vychisl. Mat. Mat. Fiz., No. 6, 855–869 (1994).
O. A. Emets, “Extremal properties of nondifferentiable convex functions on Euclidean sets of combinations with repetitions,” Ukr. Mat. Zh., 46, No.6, 680–691 (1994).
O. A. Emets, “A combinatorial model and approximate method with a prioriestimate for the solution of the optimization problem of arrangement of many-colored rectangles,” Ékonom. Mat. Met., 29, Issue 2, 294–304 (1993).
S. N. Chernikov, Linear Inequalities[in Russian], Nauka, Moscow (1968).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Emets, O.A., Kolechkina, L.M. Optimization Problem on Permutations with Linear-Fractional Objective Function: Properties of the Set of Admissible Solutions. Ukrainian Mathematical Journal 52, 1858–1871 (2000). https://doi.org/10.1023/A:1010451825582
Issue Date:
DOI: https://doi.org/10.1023/A:1010451825582