Committee constructions.
From MaRDI portal
The article contains a survey of known results in the theory of committee solutions of inconsistent constraint systems and their applications to pattern recognition, decision making and optimization. Several existence theorems are stated for committee constructions for solving certain classes of inequality systems. Further some aspects of the committee solvability of linear inequality systems are discussed, such as maximal consistent subsystems, minimal committees and their construction.
Recommendations
Cited in
(15)- Solving of optimization and identification problems by the committee methods
- The theory of committee decisions and the double median method
- An algorithm for the committee construction problem
- On a relation associated with decision making by majority voting.
- Committees of systems of linear inequalities
- Constraint elimination method for the committee problem
- scientific article; zbMATH DE number 3847212 (Why is no real title available?)
- scientific article; zbMATH DE number 3936870 (Why is no real title available?)
- scientific article; zbMATH DE number 3963599 (Why is no real title available?)
- scientific article; zbMATH DE number 4024655 (Why is no real title available?)
- scientific article; zbMATH DE number 42573 (Why is no real title available?)
- scientific article; zbMATH DE number 729979 (Why is no real title available?)
- scientific article; zbMATH DE number 2047437 (Why is no real title available?)
- Lower bounds for the number of hyperplanes separating two finite sets of points
- How to use barriers and symmetric regularization of Lagrange function in analysis of improper nonlinear programming problems
This page was built for publication: Committee constructions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2736216)