Optimality Conditions and Characterizations of the Solution Sets in Generalized Convex Problems and Variational Inequalities

We derive necessary and sufficient conditions for optimality of a problem with a pseudoconvex objective function, provided that a finite number of solutions are known. In particular, we see that the gradient of the objective function at every minimizer is a product of some positive function and the gradient of the objective function at another fixed minimizer. We apply this condition to provide several complete characterizations of the solution sets of set‐constrained and inequality‐constrained nonlinear programming problems with pseudoconvex and second‐order pseudoconvex objective functions in terms of a known solution. Additionally, we characterize the solution sets of the Stampacchia and Minty variational inequalities with a pseudomonotone‐star map, provided that some solution is known.