The problem under consideration is to select the smallest majority size such that at least one social state is not defeated by any other when restrictions on possible voters' preferences are explicitly known, and when populations of arbitrary size are possible. This problem is formulated in mathematical programming terms. The special structure of the formulation is discussed, and some results concerning bounds on the majority sizes are established.