A polynomial-time approximation scheme for monotonic optimization over the unit simplex (Development of Mathematical Optimization : Modeling and Algorithms)

The problem of minimizing a function representable as the difference of two monotonic functions over the unit simplex has a potential for various practical applications. In this paper, we discretize the problem and develop a branch-and-bound algorithm for generating an approximate optimal solution within a polynomial number of function evaluations