“…If μ = 0, the well-known concepts of monotonicity, pseudomonotonicity and quasimonotonicity are recovered (see [14,18,31,32]). If μ > 0, the requirements are strengthened and the strong counterparts of the above monotonicity concepts defined: strong monotonicity has been often exploited in algorithmic frameworks (see [13]) while strong pseudomonotonicity has been considered mainly for variational inequalities (see [33,34]) and only very recently for more general EPs. [35] Similarly, if μ < 0, weaker concepts are introduced: weak monotonicity has been exploited in a few papers [36][37][38][39], while, to the best of our knowledge, weak quasimonotonicity has been used only in [29] to prove existence results for (EP).…”