|
This article is cited in 4 scientific papers (total in 4 papers)
On the stability radius of a vector problem of linear Boolean programming
V. A. Emelichev, V. N. Krichko, D. P. Podkopaev
Abstract:
We consider a multicriteria Boolean programming problem with linear partial criteria.
We give lower and upper attainable bounds of the radius of stability of the Pareto set
in the case where both the coefficients of the vector criterion
and the elements of the constraint matrix are subject to independent disturbances. This research was supported by the Foundation for Basic Research of Republic Byelarus,
grant $\Phi$97–266.
Received: 27.04.1999 Revised: 09.11.1999
Citation:
V. A. Emelichev, V. N. Krichko, D. P. Podkopaev, “On the stability radius of a vector problem of linear Boolean programming”, Diskr. Mat., 12:2 (2000), 25–30; Discrete Math. Appl., 10:1 (2000), 103–108
Linking options:
https://www.mathnet.ru/eng/dm328https://doi.org/10.4213/dm328 https://www.mathnet.ru/eng/dm/v12/i2/p25
|
Statistics & downloads: |
Abstract page: | 526 | Full-text PDF : | 208 | References: | 62 | First page: | 3 |
|