Maximization of generalized characteristic functions of monotone systems

We consider monotone systems in which the value of the extremal criterion is determined by the worst element in some part of a given subset. Examples of practical data aggregation problems leading to such systems are given. It is shown that the so-called convex geometries (antimatroids) constitute the accessible family of subsets that are responsible for the effectiveness of the extremization algorithms of such criteria.