Abstract
A vector problem of Boolean programming with quadratic partial criteria is investigated. A set of Pareto-optimal solutions (efficient solutions) that preserve their optimality under small perturbations of vector criterion parameters is considered. The formulas for estimating numerical measures of two types of stability are found.
Similar content being viewed by others
REFERENCES
I. V. Sergienko,L. N. Kozeratskaya, andT. T. Lebedeva, Stability Analysis and Parametric Analysis of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1995).
L. N. Kozeratskaya,T. T. Lebedeva, andI. V. Sergienko, “Stability of discrete optimization problems,” Kibern. Sist. Anal., No. 3, 78–93 (1993).
N. E. Efimchik andD. P. Podkopaev, “On the kernel and radius of stability in a trajectory problem of discrete vector optimization,” Vestn. Belorus. Univ., Ser. 1, No. 1, 49–52 (1996).
N. Z. Shor andS. I. Stetsenko, Quadratic Extrema Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kiev (1989).
V. K. Leont'yev, “Stability in linear discrete problems,” Probl. Kibern., Issue 35, 169–184 (1979).
V. A. Emelichev and M. K. Kravtsov, “Stability in vector optimization path problems,” Kibern. Sist. Anal., 38 No. 4, 137–143 (1995).
V. A. Emelichev andD. P. Podkopaev, “Quantitative stability measure of the vector problem of integer programming,” Zh. Vych. Mat. Mat. Fiz., 38 No. 11, 1801–1805 (1998).
V. A. Emelichev,M. K. Kravtsov, andD. P. Podkopaev, “Quasistability of vector optimization path problems,” Mat. Zametki, 68 Issue 1, 140–145 (1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Emelichev Byelorussian State University, Minsk, Byelorussia, V.A., Nikulin, Y.V. Stability Kernel of the Quadratic Vector Problem of Boolean Programming. Cybernetics and Systems Analysis 37, 214–219 (2001). https://doi.org/10.1023/A:1016746919145
Issue Date:
DOI: https://doi.org/10.1023/A:1016746919145