Approximation Algorithms for Linear Fractional-Multiplicative Problems


In this paper we propose a Fully Polynomial Time Approximation Scheme (FPTAS) for a class of optimization problems where the feasible region is a polyhedral one and the objective function is the sum or product of linear ratio functions. The class includes the well known ones of Linear (Sum-of-Ratios) Fractional Programming and Multiplicative Programming. 


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.