Abstract
For a multicriterion three-index planar problem of choice, a polynomial (with respect to the problem dimension) algorithm is proposed and justified that finds the so-called asymptotically ideal solution whose vector estimate tends (in the sense of relative error) to an ideal point (whose coordinates are optimum values of the objective functions of the corresponding one-criterion problems) with increasing the dimension 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. Perepelitsa, “Two problems from graph theory,” Dokl. Akad. Nauk SSSR, 194, No. 6, 1269–1272 (1970).
E. Kh. Gimadi, N. I. Glebov, and A. I. Serdyukov, “An algorithm for approximate solution of the traveling salesman problem and its probabilistic analysis,” Sib. Zh. Issled. Operatsiy, 1, No. 2, 8–17 (1994).
A. D. Korshunov, “Basic properties of random graphs with a large number of nodes and edges,” Usp. Mat. Nauk, 40, No. 1, 107–173 (1985).
V. A. Emelichev and V. A. Perepelitsa, “Complexity of discrete multicriterion problems,” Discret. Mat., 6, No. 1, 3–33 (1994).
V. A. Emelichev and N. E. Efimchik, “Asymptotic approach to the problem of k-median of a graph,” Kibern. Sist. Anal., No. 5, 109–117 (1994).
I. V. Sergienko and V. A. Perepelitsa, “Finding the set of alternatives in discrete multicriterion problems,” Kibernetika, No. 5, 85–93 (1987).
V. A. Emelichev, V. A. Perepelitsa, and Kh. D. Shungerov, “Asymptotic approach to a multicriterion problem of covering a graph by stars,” Dokl. Akad. Nauk BSSR, 31, No. 5, 5–9 (1985).
M. K. Kravtsov and A. P. Krachkovskii, “Asymptotic optimality of a transport-problem plan constructed by the minimum-element method,” Kibern. Sist. Anal., No. 1, 144–151 (1999).
M. K. Kravtsov and A. P. Krachkovskii, “Asymptotic approach to the solution of a multiindex axial transport problem,” Zh. Vychisl. Mat. Mat. Fiz, 38, No. 7, 1133–1139 (1998).
M. K. Kravtsov and A. P. Krachkovskii, “Asymptotic approach to the solution of a multiindex axial problem of choice,” Vesti NAN Belarusi, Ser. Fiz.-Mat. Nauk, No. 2, 123–126 (1999).
E. Kh. Gimadi, “Asymptotically exact approach to the solution of a multiindex axial assignment problem,” in: Trans. XIth Intern. Baikal Seminar: Plenary Reports, Irkutsk (1998), pp. 62–65.
M. K. Kravtsov and A. P. Krachkovskii, “A polynomial algorithm of finding an asymptotically optimal solution of a three-index planar problem of choice,” Zh. Vychisl. Mat. Mat. Fiz, 41, No. 2, 342–345 (2001).
S. Smale, “On the average number of steps in the simplex method of linear programming,” Math. Programming, 27, No. 1, 241–262 (1983).
N. N. Kuzyurin, “An algorithm polynomial on the average in integer linear programming,” Sib. Zh. Issled. Operatsiy, 1, No. 3, 38–48 (1994).
N. N. Kuzyurin, “Metric aspects of the theory of integer linear programming,” Discret. Mat., 6, No. 4, 87–106 (1994).
V. A. Emelichev and M. K. Kravtsov, “Combinatorial problems of vector optimization,” Discret. Mat., 7, No. 1, 3–18 (1995).
M. K. Kravtsov and A. P. Krachkovskii, “Polynomial algorithm for a multiindex multicriterion axial problem of choice,” Vesti NAN Belarusi, Ser. Fiz. Mat. Nauk, No. 1, 120–123 (2001).
M. K. Kravtsov and A. P. Krachkovskii, “Asymptotic approach to the solution of a multiindex multicriterion axial transport problem,” in: Problems of Economic-Mathematical Simulation, NIEI Minekonomiki RB, Minsk (2000), pp. 49–60.
V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedrons, Graphs, and Optimization [in Russian], Nauka, Moscow (1981).
A. M. Frieze, “Complexity of 3-dimensional assignment problem,” Eur. J. Oper. Res., No. 13, 161–164 (1983).
E. A. Dinitz and M. A. Kronrod, “An algorithm of solution of an assignment problem,” Dokl. Akad. Nauk SSSR, 189, No. 1, 23–25 (1969).
M. K. Kravtsov, A. Kh. Sherman, and N. D. Averbukh, “An algorithm of solution of an assignment problem,” Izv. AN Belarusi, Ser. Fiz.-Mat. Nauk, No. 6, 102–105 (1975).
V. A. Perepelitsa, Multicriterion Problems of Graph Theory: Algorithmic Approach [in Russian], UMK VO, Kiev (1989).
M. Swamy and K. Thulasiraman, Graphs, Networks, and Algorithms [Russian translation], Mir, Moscow (1984).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kravtsov, M.K., Dichkovskaya, S.A. Asymptotic Approach to the Solution of a Multicriterion Three-Index Planar Problem of Choice. Cybernetics and Systems Analysis 40, 324–328 (2004). https://doi.org/10.1023/B:CASA.0000041989.38176.49
Issue Date:
DOI: https://doi.org/10.1023/B:CASA.0000041989.38176.49