On the solution of variational inequality problems by using cutting plane methods

This is the authors' abstract. We don't add key points for this paper.

In this paper, variational inequality problems (VIPs) defined by generalized monotone and pseudomonotone single-valued and multivalued mappings are considered. Some properties of generalized monotone and pseudomonotone mappings are established. The idea of cutting plane methods, developed originally for solving discrete optimization problems (in particular, integer linear programming problems), is applied for solving the considered VIPs.