A Fast Algorithm for a Class of Generalized Fractional Programs

DOI10.1287/mnsc.42.10.1493zbMath0881.90113OpenAlexW2166660920WikidataQ104129330 ScholiaQ104129330MaRDI QIDQ4363609

Martin Gugat

Publication date: 12 November 1997

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.42.10.1493

zbMATH Keywords

multiple criteriasuperlinear convergencedual solutionsnonconvex programs of fractional type

Mathematics Subject Classification ID

Fractional programming (90C32)

Related Items (9)

Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios ⋮ Linear programming system identification ⋮ Formulating the mixed integer fractional posynomial programming ⋮ A fast approach to deformable surface 3D tracking ⋮ An inexact proximal point method for solving generalized fractional programs ⋮ An effective branch and bound algorithm for minimax linear fractional programming ⋮ A sixth bibliography of fractional programming ⋮ On the posynomial fractional programming problems ⋮ Semi-infinite terminal problems: a newton type method

This page was built for publication: A Fast Algorithm for a Class of Generalized Fractional Programs