
We show that a consistency check of a linear system of inequalities Ax\(\leq b\) reduces to check whether Qb\(\geq 0\) for a certain matrix Q. It is a direct consequence of the Farkas-Minkowski theorem. Thus, when one has to check consistency for different values of b, one need not run a numerical algorithm for each b.
Numerical mathematical programming methods, Linear programming, linear system of inequalities, Farkas-Minkowski theorem, consistency check
Numerical mathematical programming methods, Linear programming, linear system of inequalities, Farkas-Minkowski theorem, consistency check
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
