A branch and bound algorithm for solving the sum of generalized polynomial fractional programming problem

zbMATH Open1541.90338MaRDI QIDQ6563737FDOQ6563737

Authors: Xia Liu, Xiaohua Ma, Xia Jing 

Publication date: 27 June 2024

Published in: Journal of Nonlinear and Convex Analysis (Search for Journal in Brave)

Recommendations

• Global optimization for the sum of generalized polynomial fractional functions
• Global optimization for sum of generalized fractional functions
• Global optimization of generalized linear fractional programming with nonlinear constraints
• A new approach for solving generalized linear fractional programming
• Global minimization for generalized polynomial fractional program

zbMATH Keywords

global optimizationbranch and boundlinearized relaxationgeneralized polynomial fractional programming

Mathematics Subject Classification ID

Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

This page was built for publication: A branch and bound algorithm for solving the sum of generalized polynomial fractional programming problem

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