Generating sum-of-ratios test problems in global optimization

DOI10.1023/B:JOTA.0000006959.01650.59zbMath1061.90091OpenAlexW2079265448MaRDI QIDQ597195

Harold P. Benson

Publication date: 6 August 2004

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jota.0000006959.01650.59

zbMATH Keywords

Global optimizationtest problemssum of ratioslinear fractional functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)

Related Items

Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm, A sequential method for a class of pseudoconcave fractional problems, On the global optimization of sums of linear fractional functions over a convex set, Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem, A sixth bibliography of fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• Global minimization of a generalized convex multiplicative function
• Image space analysis of generalized fractional programs
• Minimization of the sum of three linear fractional functions
• A global optimization algorithm for linear fractional and bilinear programs
• A note on the sum of a linear and linear-fractional function
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems