An iterative algorithm for a class of minimax fractional programming problems

DOI10.16366/J.CNKI.1000-2367.2018.01.003MaRDI QIDQ4688289zbMATH OpenFDO

Authors Xiao Chen, Peiping Shen

Publication date 22 October 2018

Full work available at URL https://doi.org/10.16366/J.CNKI.1000-2367.2018.01.003

zbMATH Keywords

convex programsiterative algorithmminimax problem

Mathematics Subject Classification ID

Convex programming (90C25) Fractional programming (90C32) Minimax problems in mathematical programming (90C47)

Recommendations

• Iterative algorithm of generalized fractional programming problems with polynomial constraints
• scientific article; zbMATH DE number 871324
• scientific article; zbMATH DE number 895356
• A new procedure for solving linear fractional programming problems
• scientific article; zbMATH DE number 4064786

Cited in

(1)

• Iterative algorithm of generalized fractional programming problems with polynomial constraints

This page was built for publication: An iterative algorithm for a class of minimax fractional programming problems

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