Convexifactors, generalized convexity, and optimality conditions (Q700700)

The authors make use of the concept of convexificators which was introduced by \textit{V. Jeyakumar} and \textit{D. T. Luc} [J. Optimization Theory Appl. 101, No. 3, 599--621 (1999; Zbl 0956.90033)] to establish some characterizations of quasiconvex and pseudoconvex functions. They prove also a rule for calculating a convexificator of a max function, and derive optimality conditions for inequality constrained programming problems.