On stability and quasi-stability of a vector lexicographic quadratic boolean programming problem

Authors

  • V.A. Emelichev Belarusian State University, Belarus
  • V. Nikulin Belarusian State University, Belarus

DOI:

https://doi.org/10.33993/jnaat301-679
Abstract views: 200

Abstract

We consider a vector Boolean programming problem with the linear-quadratic partial criteria. Formulas of radiuses of two types of stability, necessary and sucient conditions of stability are found.

Downloads

Download data is not yet available.

References

V. A. Emelichev and R. A. Berdysheva, The stability of linear trajectorial problems of lexicographic optimization, Kibernetika i sistemny analis, 4 (1997), 83-88.

V. A. Emelichev and R. A. Berdysheva, On the radii of steadiness, quasi-steadiness and stability of a vector trajectory problem on lexicographic optimization, Discrete Math. Appl., 8 (1998), 135-142, https://doi.org/10.1515/dma.1998.8.2.135 DOI: https://doi.org/10.1515/dma.1998.8.2.135

R. Berdysheva, V. Emelichev and E. Girlich, Stability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem, Comput. Sci. J. Moldova, 6 (1998), 35-56.

R. A. Berdysheva and V. A. Emelichev, Some kinds of stability of a combinatorial problem of lexicographic optimization, Izv. Vuzov. Matematika, 12 (1998), 11-21.

V. A. Emelichev and R. A. Berdysheva, On conditions of stability in a vector trajectorial problem of lexicographic discrete optimization , Kibernetika i sistemny analis, 4 (1998), 144-151.

V. A. Emelichev and R. A. Berdysheva, On stability measure of a vector integer problem of lexicographic optimization, Izv. NAN Belarusi. Ser. phis.-math. nauk, 4 (1999), 119-124. DOI: https://doi.org/10.1515/dma.1998.8.4.383

V. A. Emelichev and R. A. Berdysheva, On stability and quasistability of a trajectorial problem of consequent optimization, Dokl. NAN Belarusi, 43 (1999), 41-44.

V. A. Emelichev and O. A. Yanushkevich, On regularization of a vector integer lexicographic programming problem, Kibernetika i sistemny analis, 6 (1999), 125-130.

V. A. Emelichev and O. A. Yanushkevich, The stability and regularization of a vector lexicographic problem of quadratic discrete programming, Kibernetika i sistemny analis, 2 (2000), 54-62. DOI: https://doi.org/10.1007/BF02678665

V. A. Emelichev and Yu. V. Nikulin, On two types of stability of a vector linear-quadratic boolean programming problem, Diskret. analis i issledov. oper. Ser. 2, 6 (1999), 23-31. DOI: https://doi.org/10.1515/dma.1999.9.6.607

V. A Emelichev and D. P. Podkopaev, Conditions of stability, pseudo-stability and quasi-stability of the Pareto set in a vector trajectorial problem, Rev. Anal. Numer. Theor. Approx., 27 (1998), 91-97.

I. V. Sergienko, L. N. Kozertskaya and T. T. Lebedeva, Stability Investigation and Parametric Analysis of Discrete Optimization problems, Naukova Dumka, Kiev, 1995.

E. G. Belousov and V. G. Andronov, Solvability and Stability of Polynomial Programming Problems, Moscow University, 1993.

Downloads

Published

2001-02-01

How to Cite

Emelichev, V., & Nikulin, V. (2001). On stability and quasi-stability of a vector lexicographic quadratic boolean programming problem. Rev. Anal. Numér. Théor. Approx., 30(1), 35–46. https://doi.org/10.33993/jnaat301-679

Issue

Section

Articles