Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

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

From MaRDI portal
Publication:6563737
Jump to:navigation, search

zbMATH Open1541.90338MaRDI QIDQ6563737FDOQ6563737

Xia Liu, Xia Jing, Xiaohua Ma

Publication date: 27 June 2024

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






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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6563737&oldid=40097068"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 17:09. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki