Pages that link to "Item:Q2479363"
From MaRDI portal
The following pages link to Global optimization for sum of generalized fractional functions (Q2479363):
Displaying 13 items.
- A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
- Maximizing for the sum of ratios of two convex functions over a convex set (Q336507) (← links)
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
- Solving the sum-of-ratios problems by a harmony search algorithm (Q966084) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← links)
- A deterministic method for solving the sum of linear ratios problem (Q2004237) (← links)
- An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
- Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)
