O-convex nonlinear programming problems

摘要

A class of sets and a class of functions called O-convex sets and O-convex functions are introduced by relaxing the definitions of convex sets andconvex functions. This kind of generalized convexity is based on the effect of anoperator O on the sets and domain of definition of the functions. The optimalityresults for O-convex programming problems are established.