Problems of maximizing or minimizing monotonic functions of n variables und
er monotonic constraints are discussed. A general framework for monotonic o
ptimization is presented in which a key role is given to a property analogo
us to the separation property of convex sets. The approach is applicable to
a wide class of optimization problems, including optimization problems dea
ling with functions representable as differences of increasing functions (d
.i. functions).