Combinatorial algorithms making support of managerial decisions
DOI:
https://doi.org/10.15407/dopovidi2014.11.033Keywords:
combinatorial algorithms, managerial decisionsAbstract
The bounded and unbounded combinatorial recognition problems are posed. Using a problem of switches as an example, we show how to divide the subset of switches into groups so that the given number of faulty switches could be found by minimal number of tests. We also consider the problem of choosing the number of elements of the same type from two given sets. For every problem, we give the evaluating formulas for the minimal number of tests.
Downloads
References
Dovgyi S. O., Bidyuk P. I., Trofimchuk O. M., Savenkov O. I. The methods of forecasting in decision support systems, Kyiv: Azimut, 2011 (in Ukrainian).
Bidyuk P. I., Trofimchuk O. M., Fedorov D. V. Nauk. visti NTUU “KPI”, 2011, No 6: 42–53 (in Ukrainian).
Pepeliaev V. A., Knopov P. S., Atoev K. L., et al. Nauka ta innovatsii, 2010, No 3: 39–46 (in Ukrainian).
Atoev K. L., Pepeliaev V. A. Kompiut. matematika, 2010, No 2: 32–41 (in Russian).
Golodnikova N. A., Levashko T. P., Pepeliaev V. A. Kompiut. matematika, 2010, No 2: 42–51 (in Russian).
Pepeliaev V. A., Atoev K. L. The ranking of Ukrainian regions in terms of socio-economic and natural and man-made threats. Proceedings of the 18th Intern. Conf. "Decision making under uncertainty (PDMU – 2011)”. Yalta, 2011: 139–140 (in Russian).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Reports of the National Academy of Sciences of Ukraine
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
