RO  EN
IMI/Publicaţii/CSJM/Ediţii/CSJM v.10, n.3 (30), 2002/

Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem

Authors: V.A. Emelichev, V.N. Krichko, Yu.V. Nikulin
Keywords: Vector MINMAX Boolean programming problem, efficient solution, stability radius.

Abstract

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.

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

Fulltext

Adobe PDF document0.14 Mb