On the Global Optimization of Sums of Linear Fractional Functions over a Convex Set

By Harold P. Benson. 2004

70 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/d3fa738562b524891fbf13903baacb2acffbd769

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Chrysanthos E. Gounaris
2. Christodoulos A. Floudas
3. John L. Klepeis

In Numerical Analysis

1. Christodoulos A. Floudas
2. Chrysanthos E. Gounaris
3. Ruth Misener

Citations in the corpus

• Solving Sum of Ratios Fractional Programs via Concave Minimization (2007, unknown): “From [20], for each i = 1,2, .”
• A review of recent advances in global optimization (2009, background): “Benson (2004) showed how fractional programs can be reformulated so as to be solvable by parametric convex programming and concave minimization methods.”