Pages that link to "Item:Q1026289"
From MaRDI portal
The following pages link to Solving sum of quadratic ratios fractional programs via monotonic function (Q1026289):
Displaying 11 items.
- Maximizing for the sum of ratios of two convex functions over a convex set (Q336507) (← links)
- Global optimization algorithm for sum of generalized polynomial ratios problem (Q345766) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
- Global optimization for the generalized polynomial sum of ratios problem (Q548182) (← links)
- Solving the sum-of-ratios problems by a harmony search algorithm (Q966084) (← links)
- Global minimization for generalized polynomial fractional program (Q1718667) (← links)
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
