Abstract
A Boolean problem of vector lexicographic optimization is considered. Its partial criteria are projections of linear functions on the nonnegative orthant. A formula is obtained for calculation of the limit level of perturbations of the parameter space of the problem with a metric l1 that preserve the lexicographic optimality of a given solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
I. V. Sergienko, L. N. Kozeratskaya, and T. T. Lebedeva, “Investigation of stability and parametric analysis of discrete optimization problems,” Naukova Dumka, Kiev (1995).
L. N. Kozeratskaya, and T. T. Lebedeva, and I. V. Sergienko, “Stability of problems of discrete optimization,” Kibern. Sist. Anal., No. 3, 78–93 (1993).
Yu. N. Sotskov, V. K. Leont’ev, and E. N. Gordeev, “Some concepts of stability analysis in combinatorial optimization,” Discrete Appl. Math., 58, No.2, 169–190 (1995).
N. J. Greenberg, “An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization,” in: Advances in Comput. and Stochast. Optimizat. Logic Program. and Heurist. Search, Kluwer, Boston (1998), pp. 97–148.
Yu. N. Sotskov, V. S. Tanaev, and F. Werner, “Stability radius of an optimal schedule: A survey and recent developments,” in: Industrial Appl. of Combinator. Optimizat, Kluwer, Dordrecht (1998), pp. 72–108.
V. A. Emelichev, E. Girlich, Yu. V. Nikulin, and D. P. Podkopaev, “Stability and regularization of vector problems of integer linear programming,” Optimization, 51, No.4, 645–676 (2002).
S. E. Bukhtoyarov, V. A. Emelichev, and Yu. V. Stepanishina, “Stability of Discrete Vector Problems with the Parametric Principle of Optimality,” Kibern. Sist. Anal., No. 4, 155–166 (2003).
I. V. Sergienko and N. V. Semenova, “Integer programming problems with inexact data: Exact and approximate solutions,” Kibern. Sist. Anal., No. 6, 75–86 (1995).
I. V. Sergienko, V. A. Roshchin, and N. V. Semenova, “Some integer programming problems with inexact data and their solution,” Probl. Upravlen. Inf., No. 6, 116–123 (1998).
M. Ehrgott and X. Gandibleux, “A survey and annotated bibliography of multicriteria combinatorial optimization,” Oper. Res. Spektr., 22, No.4, 425–460 (2000).
V. A. Emelichev and D. P. Podkopayev, “Stability and regularization of vector problems of integer linear programming,” Diskret. Anal. Issled. Operats., Ser. 2, 8, No.1, 47–69 (2001).
T. T. Levedeva and T. I. Sergienko, “Comparative analysis of different types of stability with respect to constraints of a vector integer-optimization problem,” Kibern. Sist. Anal., No. 1, 63–70 (2004).
V. A. Emelichev and K. G. Kuzmin, “Stability radius for a strictly effective solution to a vector minimization problem for threshold functions in l 1 metric,” Kibern. Sist. Anal., No. 3, 62–67 (2004).
V. A. Emelichev and Yu. V. Nikulin, “Stability of an efficient solution of a vector problem of integer linear programming,” in: Dokl. NAN Bekarusi, 44, No.4, 26–28 (2000).
V. A. Emelichev and V. G. Pokhil’ko, “Sensitivity analysis of efficient solutions of a vector problem of minimization of linear forms on a set of substitutions,” Diskret. Mat. 12, No.3, 37–48 (2000).
V. A. Emelichev and V. N. Krichko, “Stability radius of an efficient solution to a vector square-law problem of Boolean programming,” Zh. Vychisl. Mat. Mat. Fiz., 41, No.2, 346–350 (2001).
V. A. Emelichev and Yu. V. Stepanishina, “Multicriterion combinatorial linear problems: Parametrization of the principle of optimality and stability of efficient solutions,” Diskret. Mat., 13, No.4, 43–51 (2001).
V. A. Emelichev and K. G. Kuzmin, “Stability of an efficient solution of a vector combinatorial problem in l 1 metric,” Dokl. NAN Belarusi, 47, No.5, 25–28 (2003).
V. A. Emelichev, K. G. Kuzmin, and A. M. Leonovich, “Stability in vector combinatorial optimization problems,” Avtomat. Telemekh., No. 2, 79–92 (2004).
V. A. Emelichev, V. N. Krichko, and Yu. V. Nikulin, “The stability radius of an efficient solution in minimax Boolean programming problem,” Control and Cybernetics, 33, No.1, 127–132 (2004).
V. A. Emelichev and K. G. Kuzmin, “Stability radius of a lexicographic optimum of a vector Boolean problem with partial criteria that are projections of linear functions on R +,” in: Proc. IIth Intern. School-Seminar “Theory of Decision Making,” Uzhgorod. State University, Uzhgorod (2004), pp. 36–37.
R. A. Berdysheva and V. A. Emelichev, “Stability radius of a lexicographic optimum of a vector trajectory problem,” Vestnik Belorussk. Univ., Ser. 1, No. 1, 43–46 (1998).
I. I. Yeremin and V. D. Mazurov, Nonstationary Processes of Mathematical Programming [in Russian], Nauka, Moscow (1979).
I. I. Yeremin, Vl. D. Mazurov, and N. N. Astaf’yev, Improperly Posed Problems of Linear and Convex Programming [in Russian], Nauka, Moscow (1983).
Ye. A. Berdnikova, I. I. Yeremin, and L. D. Popov, “Distributed Fejer processes for systems of linear inequalities and linear programming problems,” Avtomat. Telemekh., No. 2, 16–32 (2004).
I. V. Sergienko, Mathematical Models and Methods of Solution of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1988).
Yu. Yu. Chervak, Optimization: Unimprovable Choice [in Ukrainian], Uzhgorod. State University, Uzhgorod (2002).
Author information
Authors and Affiliations
Additional information
This work is performed within the framework of the State Program of Fundamental Investigations of the Republic of Belarus “Mathematical Structures 29.”
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 71–81, March–April 2005.
Rights and permissions
About this article
Cite this article
Emelichev, V.A., Kuzmin, K.G. Stability Radius of a Lexicographic Optimum of a Vector Problem of Boolean Programming. Cybern Syst Anal 41, 215–223 (2005). https://doi.org/10.1007/s10559-005-0054-3
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-005-0054-3