Abstract
A class of sets and a class of functions called theta-convex sets and theta-convex functions are introduced by relaxing the definitions of convex sets and convex functions. This kind of generalized convexity is based on the effect of an operator theta on the sets and domain of definition of the functions. The optimality results for theta-convex programming problems are established.