Verification of data in certain problems of linear programming and the generalized Bernshtein problem

We study the problem of finding the necessary and sufficient conditions of the fact that a given set of numbers could be a set of probabilities of certain events and probabilities of the pairwise interselection of such events. The algorithm of building a system of inequalities for solving this problem is obtained. The application of this algorithm to more general problems is discussed.