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: V.A. Emelichev, V.N. Krichko, Yu.V. Nikulin
Keywords: Vector MINMAX Boolean programming problem, efficient solution, stability radius.
– 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.Vladimir A. Emelichev, Vitaly N. Krichko, Yury V. Nukulin
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
- Nine Universal Circular Post Machines
- On enhanced time-varying distributed H systems
- Biocomputing system of living cells
- The splitting method and Poincare's theorem: (I) - the geometric part
- Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem
- Algorithms for solving discrete control problems on networks
- An algorithm for solving the transport problem on network with concave cost functions of flow on edges
- Abstracts of Dr.hab. Theses
- The CSJM's 10th anniversary
