Maximizing the ratio of two convex functions over a convex set

DOI10.1002/nav.20143zbMath1151.90534OpenAlexW2064105707MaRDI QIDQ5438529

Harold P. Benson

Publication date: 23 January 2008

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20143

zbMATH Keywords

global optimizationbranch and boundfractional programmingratio of convex functions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32)

Related Items (3)

Maximizing for the sum of ratios of two convex functions over a convex set ⋮ Optimising portfolio diversification and dimensionality ⋮ A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximizing the ratio of two convex functions over a convex set