A combined algorithm for fractional programming

DOI10.1023/A:1012998904482zbMath0992.90071OpenAlexW193304542MaRDI QIDQ5959292

Jianming Shi

Publication date: 26 March 2002

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012998904482

zbMATH Keywords

fractional programmingcutting planeband-and-bound algorithmd.c. functions. global optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Related Items (4)

Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios ⋮ Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems ⋮ An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem ⋮ Conical partition algorithm for maximizing the sum of dc ratios

This page was built for publication: A combined algorithm for fractional programming