Generating the efficient frontier of a class of bicriteria generalized fractional programming

摘要

In this paper, a particular class of bicriteria maximization problems over a compact polyhedron is considered. The first component of the objective function is the ratio of powers of affine functions and the second one is linear. Several theoretical properties are provided, such as the pseudoconcavity of the first criterium of the objective function, the connectedness and compactness of both the efficient frontier and the set of efficient points. The obtained results allow us to propose a new simplex-like solution method for generating the whole efficient frontier; to better clarify the use of the suggested algorithm, several examples are described and the results of a computational test are presented.