Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem

Vladimir A. Emelichev; Vitaly N. Krichko; Yury V. Nikulin

Computer Science Journal of Moldova (Nov 2002)

Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem

Vladimir A. Emelichev,
Vitaly N. Krichko,
Yury V. Nikulin

Affiliations

Vladimir A. Emelichev: Belarusian State University, a. Fr. Skoryna, 4, Minsk 220050, Belarus
Vitaly N. Krichko: Belarusian State University, a. Fr. Skoryna, 4, Minsk 220050, Belarus
Yury V. Nikulin: Belarusian State University, a. Fr. Skoryna, 4, Minsk 220050, Belarus

Journal volume & issue: Vol. 10, no. 3(30)
pp. 320 – 328

Abstract

Read online

We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained.

Published in Computer Science Journal of Moldova

ISSN: 1561-4042 (Print); 2587-4330 (Online)
Publisher: Vladimir Andrunachievici Institute of Mathematics and Computer Science
Country of publisher: Moldova, Republic of
LCC subjects: Science: Mathematics: Instruments and machines: Electronic computers. Computer science
Website: http://www.math.md/en/publications/csjm/

About the journal

Abstract

Keywords