The Working Group on Generalized Convexity (WGGC) was founded during the 15th International Symposium on Mathematical Programming in Ann Arbor (Michigan, U.S.A.), August 1994. It is a growing, interdisciplinary group of scholars from operations research, economics, engineering, applied sciences, mathematics, statistics, among others, with an interest in generalizations of the classical concept of a convex function. Models involving such functions have a significantly wider range of applicability than convex models.
Much of the earlier work in generalized convexity was done by researchers in mathematical programming (e.g., Avriel, Fenchel, Mangasarian, Martos) and in economic theory (e.g., Arrow, Diewert, Eichhorn, Kannai). To this day, both disciplines continue to benefit from this kind of research. In addition, generalized convexity has been studied in management science, engineering, applied sciences, mathematics, statistics, for example. We also mention fractional programming (optimization of ratios of functions) with well over one thousand publications which significantly overlaps with generalized convexity. On the other hand, a nontraditional topic such as abstract convexity is gaining interest now too. Another development in generalized convexity has been the study of generalized monotone maps, introduced in such a way that in case of gradient maps generalized monotonicity characterizes generalized convexity of the underlying function. Generalized monotone maps play a role in economics, complementarity problems, variational inequalities and, more generally, equilibrium problems arising in various disciplines.
Like in other areas of mathematical programming, contributions in generalized convexity/monotonicity range from theoretical and algorithmic to computational and applied research.
The “Working Group on Generalized Convexity” has 455 members from 52 countries.
Membership is free of charge.
The group’s activities are guided by the International Scientific Committee and its Chair.