Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem
Authors: Vladimir A. Emelichev, Vitaly N. Krichko, Yury V. Nikulin
Keywords: Vector MINMAX Boolean programming problem, efficient solution, stability radius.
MSC: 90C29, 90C31
– 0.14 Mb
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.MSC: 90C29, 90C31
V.A.Emelichev, V.N.Krichko, Yu.V.Nikulin,
Belarusian State University
a. Fr. Skoryna, 4,
Minsk 220050, Belarus
E-mail:
Belarusian State University
a. Fr. Skoryna, 4,
Minsk 220050, Belarus
E-mail:
Fulltext
– 0.14 Mb
Contents
- Configuration of local area network set of servers
- Discrete Control Processes, Dynamic Games and Multicriterion Control
- Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem
- The Analysis of Experimental Results of Reinforcement Learning Systems
- Hints About Some Baseful but Indispensable Elements in Speech Recognition and Reconstruction
- Experimental functional realization of attribute grammar system
- Network version of the computer algebra system bergman
- Fault-based analysis of flexible ciphers
- One class of simply periodic motions of a heavy solid with a fixed point
- Post-graduate Studies in Mathematics and Computer Science Proposed by the Institute of Mathematics and Computer Science of the Academy of Sciences of the Republic of Moldova
