|
Avtomatika i Telemekhanika, 2004, Issue 2, Pages 43–54
(Mi at1517)
|
|
|
|
This article is cited in 12 scientific papers (total in 12 papers)
Optimization of Finite-Dimensional Systems
Committees of systems of linear inequalities
V. D. Mazurov, M. Yu. Khachai Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
Abstract:
The conceptual issues of the theory of committee decision rules were considered, and its close relationship with the theory of substantiation of collective decision making and teaching neural networks was demonstrated. The problem of the minimum committee of an incompatible system of constraints, which arises at the stage of constructing the committee decision rule with a small number of elements, was discussed by itself. The problem of the minimum committee is known to be NP-hard. Results concerning estimation of the computational complexity of allied problems were obtained. To solve the problem of minimum committee of an incompatible system of linear inequalities, an effective approximate algorithm was suggested, its correctness was proved and computational complexity and guaranteed precision were estimated.
Citation:
V. D. Mazurov, M. Yu. Khachai, “Committees of systems of linear inequalities”, Avtomat. i Telemekh., 2004, no. 2, 43–54; Autom. Remote Control, 65:2 (2004), 193–203
Linking options:
https://www.mathnet.ru/eng/at1517 https://www.mathnet.ru/eng/at/y2004/i2/p43
|
Statistics & downloads: |
Abstract page: | 343 | Full-text PDF : | 126 | References: | 58 | First page: | 2 |
|