Recent decades have seen the development of many new multi-criteria decision-making methods, mainly through in-depth research on them. The main ones are techniques such as PRO-METHEE, PAPRIKA, VIKOR, ELECTREE, and especially BWM (Best-Worst Method) and AHP (Analytic Hierarchy Process, see e.g. Mazurek [1], Liang et al. [2], Saaty [3,4], Brans et al. [17,18], Hansen et al. [25], Opricovic et al. [26] and Alkihairi et al. [27].All these methods use pairwise comparison matrices, which are used also in such many other fields, see e.g. Koczkodaj et al. [20,21,22,23], Cavallo et al [24]. Since the authors of this paper, have repeatedly participated in research on methods that use them, they have also confronted the problem of efficiently generating random comparison matrices -necessary, for example, to perform Monte Carlo simulations for such methods that require large amounts of random data, see e.g. Caflisch [5]. This problem was particularly evident in the case of matrices, the so-called "large" (from 6x6 to 10x10) and when one wanted to simultaneously obtain a low CR -consistency range (especially below the value of 0.1). Then the generation times for several thousand random matrices with the desired parameters could reach even several days. This was a big obstacle for performing efficient research, as the need to examine large amounts of data with a specific consistency interval may be needed on such fronts as the study of constructive consistent approximations