Emelichev, Vladimir A.; Krichko, Vitaly N.; Nikulin, Yury V. Sensitivity analysis of efficient solution in vector MINMAX Boolean programming problem. (English) Zbl 1003.90040 Comput. Sci. J. Mold. 10, No. 2(29), 136-142 (2002). Summary: We consider a multiple criterion Boolean programming problem with minmax partial criteria. The extreme level of independent perturbations of partial criteria parameters such that the efficient (Pareto optimal) solution preserves optimality has been obtained. MSC: 90C29 Multi-objective and goal programming 90C31 Sensitivity, stability, parametric optimization 90C47 Minimax problems in mathematical programming 90C09 Boolean programming Keywords:efficient solution; stability radius; Pareto optimal; multiple criterion Boolean programming; minmax partial criteria PDFBibTeX XMLCite \textit{V. A. Emelichev} et al., Comput. Sci. J. Mold. 10, No. 2(29), 136--142 (2002; Zbl 1003.90040)