A branch and bound algorithm for solving the sum of generalized polynomial fractional programming problem
From MaRDI portal
Publication:6563737
zbMATH Open1541.90338MaRDI QIDQ6563737FDOQ6563737
Publication date: 27 June 2024
Published in: Journal of Nonlinear and Convex Analysis (Search for Journal in Brave)
global optimizationbranch and boundlinearized relaxationgeneralized polynomial fractional programming
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)