Generating sum-of-ratios test problems in global optimization
From MaRDI portal
Recommendations
Cites work
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A global optimization algorithm for linear fractional and bilinear programs
- A note on the sum of a linear and linear-fractional function
- Global minimization of a generalized convex multiplicative function
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- scientific article; zbMATH DE number 1445369 (Why is no real title available?)
- Image space analysis of generalized fractional programs
- Minimization of the sum of three linear fractional functions
Cited in
(6)- On generating nonconvex optimization test problems
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
- A sixth bibliography of fractional programming
- 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 sequential method for a class of pseudoconcave fractional problems
This page was built for publication: Generating sum-of-ratios test problems in global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q597195)
