Abstract
Complex discrete multicriteria problems over a combinatorial set of permutations are analyzed. Some properties of an admissible domain for a combinatorial multicriteria problem embedded into an arithmetic Euclidian space are considered. Optimality conditions are obtained for different types of effective solutions. A new approach to solving the problems formulated is constructed and substantiated.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
I. V. Sergienko, Mathematical Models and Methods for Solving Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1988).
I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods for the Computer Solution of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kiev (1981).
I. V. Sergienko, L. N. Kozeratskaya, and T. T. Lebedeva, Stability Investigation and Parametric Analysis of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1995).
I. V. Sergienko, T. T. Lebedeva, and N. V. Semenova, “Existence of solutions in vector optimization problems,” Cybernetics and Systems Analysis, No. 6, 39–46 (2000).
T. T. Lebedeva, N. V. Semenova, and T. I. Sergienko, “Optimality and decidability conditions of in linear vector optimization problems with a convex admissible set,” Dop. NAN Ukr., No. 10, 80–85 (2003).
I. V. Sergienko, V. A. Roshchin, and N. V. Semenova, “Some integer programming problems with ambiguous data and their solution,” Probl. Upravlen. Inf., No. 6, 116–123 (1998).
T. T. Lebedeva, N. V. Semenova, and T. I. Sergienko, “Stability of vector problems of integer optimization: Relationship with the stability of sets of optimal and nonoptimal solutions,” Cybernetics and Systems Analysis, No. 4, 90–100 (2005).
V. V. Podinovskii and V. D. Nogin, Pareto-Optimal Solutions of Multicriteria Problems [in Russian], Nauka, Moscow (1982).
Yu. G. Stoyan and S. V. Yakovlev, Mathematical Models and Optimization Methods of Geometric Design [in Russian], Naukova Dumka, Kiev (1986).
Yu. G. Stoyan and O. O. Yemets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Inst. Sist. Doslid. Osvity, Kyiv (1993).
O. O. Yemets and L. M. Kolechkina, Combinatory Optimization Problems with Linear-Fractional Objective Functions [in Ukrainian], Naukova Dumka, Kyiv (2005).
V. A. Roshchin, N. V. Semenova, and I. V. Sergienko, “Solution and investigation of one class of inexact integer programming problems,” Cybernetics, No. 2, 42–47 (1989).
V. A. Roshchin, N. V. Semenova, and I. V. Sergienko, “Decomposition approach to solving some integer programming problems with inexact data,” Zh. Vychisl. Mat. Mat. Fiz., 29, No. 5, 786–791 (1990).
L. S. Lasdon, Large-Scale Systems Optimization [Russian translation], Mir, Moscow (1975).
Yu. M. Ermol’ev, I. I. Lyashko, V. S. Mikhalevich, and V. I. Tyuptya, Mathematical Methods of Operations Research [in Russian], Vyshcha Shkola, Kiev (1979).
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the Fundamental Research Fund of Ukraine (project Φ251/094).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 158–172, May–June 2008.
Rights and permissions
About this article
Cite this article
Semenova, N.V., Kolechkina, L.N. & Nagirna, A.N. An approach to solving discrete vector optimization problems over a combinatorial set of permutations. Cybern Syst Anal 44, 441–451 (2008). https://doi.org/10.1007/s10559-008-9016-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-008-9016-x