Iterative algorithm of generalized fractional programming problems with polynomial constraints

DOI10.13548/J.SXZZ.20181214.003MaRDI QIDQ3306668zbMATH OpenFDO

Authors Fengli Ban, Peiping Shen

Publication date 12 August 2020

Full work available at URL https://doi.org/10.13548/J.SXZZ.20181214.003

zbMATH Keywords

generalized fractional programminggeometric programmingiterative algorithm

Mathematics Subject Classification ID

Fractional programming (90C32)

Recommendations

• An iterative algorithm for a class of minimax fractional programming problems
• Global minimization for generalized polynomial fractional program
• A fully polynomial time approximation algorithm for generalized fractional programs
• An \(\varepsilon\)-approximation algorithm for generalized fractional programs
• Generalized fractional programming: Algorithms and numerical experimentation

Cited in

(1)

• An iterative algorithm for a class of minimax fractional programming problems

This page was built for publication: Iterative algorithm of generalized fractional programming problems with polynomial constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3306668)