Approximation algorithm for a class of global optimization problems

摘要

In this paper we develop and derive the computational cost of an e-approximation algorithm for a class of global optimization problems, where a suitably defined composition of some ratio functions is minimized over a convex set. The result extends a previous one about a class of Linear Fractional/Multiplicative problems.