Abstract
Conditions are found under which a multicriteria problem with a finite set of vector estimates is solvable by means of the linear criteria convolution (LCC) algorithm, that is, any Pareto optimum for the problem can be obtained as an optimum solution to a one-criterion problem with an aggregated criterion defined as an LCC. Also, an algorithm is suggested that is polynomial in dimension and reduces any problem with minimax and minimin criteria to an equivalent vector problem with the same Pareto set solvable by the LCC algorithm.
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. K. Kravtsov, and O. A. Yanushkevich, “Lexicographical optima in a multicriteria problem of discrete optimization”,Mat. Zametki [Math. Notes]58, No. 3, 365–371 (1995).
A. M. Geoffrion, “Proper efficiency and the theory of vector maximization”,J. Math. Anal. Appl.,22, 618–630 (1968).
V. S. Mikhalevich and V. L. Volkovich,Computational Methods of Analysis and Design of Complex Systems [in Russian] Nauka, Moscow (1982).
V. V. Podinovskii and V. D. Nogin,Pareto Optimal Solutions of Multicriteria Problems [in Russian], Nauka, Moscow (1982).
Yu. A. Dubov, S. I. Travkin, and V. N. Yakimets,Multicriteria Models of Forming and Selecting System Variants [in Russian], Nauka, Moscow (1986).
R. E. Burkard, H. Keiding, J. Krarup and P. M. Pruzan, “A relationship between optimality and efficiency in multicriteria 0–1 programming problems,”Comput. Oper. Res.,8, No. 4, 241–247 (1981).
V. A. Emelichev and V. A. Perepelitsa, “Complexity of discrete multicriteria problems”,Diskret. Mat. [Discrete Math. Appl.],6, No. 1, 3–33 (1994).
V. A. Emelichev and M. K. Kravtsov, “On unsolvability of vector problems of discrete optimization on systems of subsets in the class of linear criteria convolution algorithms”,Dokl. Ross. Akad. Nauk [Russian Acad. Sci. Dokl.],334, No. 1, 9–11 (1994).
V. A. Emelichev and M. K. Kravtsov, “On problems of vector discrete optimization on systems of subsets unsolvable by linear convolution algorithms”,Zh. Vychisl. Mat. i Mat. Fiz. [Comput. Math. and Math. Phys.],34, No. 7, 1082–1094 (1994).
V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov,Polyhedra, Graphs, Optimization, [in Russian], Nauka, Moscow (1981).
A. A. Gladkii and O. A. Yanushkevich, “On linear convolution of partial criteria of the vector minimization problem”, in:The 9th All-Russian Conference “Mathematical Programming and Applications” [in Russian], Abstracts of reports, Ekaterinburg (1995), p. 67.
C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, New Jersey (1982).
V. A. Emelichev and M. K. Kravtsov, “On combinatorial problems of vector optimization”,Diskret. Mat. [Discrete Math. Appl.],7, No. 1, 3–18 (1995).
V. K. Leont'ev and É. N. Gordeev, “Qualitative investigation of trajectory problems”,Kibernetika [Cybernetics], No. 5, 82–89 (1986).
V. A. Emelichev [V. A. Yemelichev], M. K. Kravtsov, and O. A. Yanushkevich, “On solvability of vector problems on systems of subsets using a linear criteria convolution algorithm”, in:2nd International Conference “Mathematical Algorithms” Abstracts, Nizhnii Novgorod (1995), p. 21.
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 62, No. 4, pp. 502–509, October, 1997.
Translated by V. N. Dubrovsky
Rights and permissions
About this article
Cite this article
Kravtsov, M.K., Yanushkevich, O.A. Solvability of the vector problem by the linear criteria convolution algorithm. Math Notes 62, 420–425 (1997). https://doi.org/10.1007/BF02358974
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02358974