Problems of maximizing or minimizing monotonic functions of n variables under monotonic constraints are discussed. A general framework for monotonic optimization is presented in which a key role is given to a property analogous to the separation property of convex sets. The approach is applicable to a wide class of optimization problems, including optimization problems dealing with functions representable as differences of increasing functions (d.i. functions).
No takes yet. Share an insight, caveat, or question.
Hoàng Tụy (2000) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: