1. Dipartimento di Informatica, Universit?? di Torino, Corso Svizzera, 185, 10149, Torino, Italy 2. Dipartimento di Ingegneria Informatica, Universit?? di Parma, Viale G.P. Usberti 181/A, 43124, Parma, Italy
Abstract:
In this paper we propose a Fully Polynomial Time Approximation Scheme for a class of optimization problems where the feasible region is a polyhedral one and the objective function is the sum or product of ratios of linear functions. The class includes the well known ones of Linear (Sum-of-Ratios) Fractional Programming and Multiplicative Programming.